/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-34549b5 [2022-04-08 03:34:56,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:34:56,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:34:56,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:34:56,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:34:56,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:34:56,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:34:56,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:34:56,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:34:56,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:34:56,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:34:56,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:34:56,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:34:56,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:34:56,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:34:56,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:34:56,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:34:56,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:34:56,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:34:56,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:34:56,097 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:34:56,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:34:56,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:34:56,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:34:56,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:34:56,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:34:56,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:34:56,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:34:56,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:34:56,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:34:56,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:34:56,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:34:56,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:34:56,110 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:34:56,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:34:56,111 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:34:56,111 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:34:56,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:34:56,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:34:56,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:34:56,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:34:56,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:34:56,123 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:34:56,133 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:34:56,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:34:56,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:34:56,135 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:34:56,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:34:56,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:34:56,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:34:56,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:34:56,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:34:56,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:34:56,136 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:34:56,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:34:56,136 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:34:56,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:34:56,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:34:56,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:34:56,137 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:34:56,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:34:56,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:34:56,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:34:56,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:34:56,137 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:34:56,137 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:34:56,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:34:56,137 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:34:56,138 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 03:34:56,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:34:56,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:34:56,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:34:56,369 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:34:56,371 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:34:56,372 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_01-2.c [2022-04-08 03:34:56,429 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a42b384b9/43e0f34b9ecc47f2857e7c50389120d2/FLAG0308dc7a0 [2022-04-08 03:34:56,816 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:34:56,816 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-2.c [2022-04-08 03:34:56,823 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a42b384b9/43e0f34b9ecc47f2857e7c50389120d2/FLAG0308dc7a0 [2022-04-08 03:34:56,838 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a42b384b9/43e0f34b9ecc47f2857e7c50389120d2 [2022-04-08 03:34:56,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:34:56,842 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:34:56,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:34:56,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:34:56,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:34:56,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:34:56" (1/1) ... [2022-04-08 03:34:56,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27eab4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:56, skipping insertion in model container [2022-04-08 03:34:56,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:34:56" (1/1) ... [2022-04-08 03:34:56,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:34:56,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:34:56,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-2.c[323,336] [2022-04-08 03:34:57,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:34:57,032 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:34:57,040 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-2.c[323,336] [2022-04-08 03:34:57,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:34:57,068 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:34:57,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57 WrapperNode [2022-04-08 03:34:57,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:34:57,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:34:57,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:34:57,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:34:57,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:34:57,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:34:57,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:34:57,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:34:57,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:34:57,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:34:57,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 03:34:57,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 03:34:57,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:34:57,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:34:57,168 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:34:57,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:34:57,168 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:34:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:34:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:34:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:34:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:34:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:34:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:34:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 03:34:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:34:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:34:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:34:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:34:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:34:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:34:57,251 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:34:57,253 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:34:57,595 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:34:57,601 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:34:57,601 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-08 03:34:57,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:34:57 BoogieIcfgContainer [2022-04-08 03:34:57,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:34:57,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:34:57,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:34:57,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:34:57,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:34:56" (1/3) ... [2022-04-08 03:34:57,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbeb297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:34:57, skipping insertion in model container [2022-04-08 03:34:57,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (2/3) ... [2022-04-08 03:34:57,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbeb297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:34:57, skipping insertion in model container [2022-04-08 03:34:57,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:34:57" (3/3) ... [2022-04-08 03:34:57,612 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_01-2.c [2022-04-08 03:34:57,616 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:34:57,616 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:34:57,654 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:34:57,660 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 03:34:57,661 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:34:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:34:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 03:34:57,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:34:57,690 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:34:57,690 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:34:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:34:57,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1209894008, now seen corresponding path program 1 times [2022-04-08 03:34:57,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:57,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1881480697] [2022-04-08 03:34:57,711 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:34:57,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1209894008, now seen corresponding path program 2 times [2022-04-08 03:34:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:34:57,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635523018] [2022-04-08 03:34:57,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:34:57,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:34:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:34:57,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:34:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:34:57,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {38#true} is VALID [2022-04-08 03:34:57,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-08 03:34:57,972 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #107#return; {38#true} is VALID [2022-04-08 03:34:57,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {43#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:34:57,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {38#true} is VALID [2022-04-08 03:34:57,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-08 03:34:57,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #107#return; {38#true} is VALID [2022-04-08 03:34:57,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret22 := main(); {38#true} is VALID [2022-04-08 03:34:57,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {38#true} is VALID [2022-04-08 03:34:57,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {38#true} assume !true; {39#false} is VALID [2022-04-08 03:34:57,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2022-04-08 03:34:57,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-08 03:34:57,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2022-04-08 03:34:57,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-08 03:34:57,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2022-04-08 03:34:57,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {39#false} is VALID [2022-04-08 03:34:57,982 INFO L272 TraceCheckUtils]: 13: Hoare triple {39#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {39#false} is VALID [2022-04-08 03:34:57,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-08 03:34:57,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-08 03:34:57,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-08 03:34:57,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:34:57,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:34:57,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635523018] [2022-04-08 03:34:57,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635523018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:34:57,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:34:57,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:34:57,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:34:57,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1881480697] [2022-04-08 03:34:57,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1881480697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:34:57,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:34:57,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:34:57,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847142293] [2022-04-08 03:34:57,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:34:57,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 03:34:57,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:34:57,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:58,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:34:58,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 03:34:58,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:58,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 03:34:58,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:34:58,053 INFO L87 Difference]: Start difference. First operand has 35 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:58,168 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2022-04-08 03:34:58,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 03:34:58,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 03:34:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:34:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-04-08 03:34:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-04-08 03:34:58,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2022-04-08 03:34:58,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:34:58,277 INFO L225 Difference]: With dead ends: 61 [2022-04-08 03:34:58,277 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 03:34:58,279 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:34:58,281 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:34:58,281 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 43 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:34:58,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 03:34:58,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 03:34:58,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:34:58,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:34:58,307 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:34:58,307 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:34:58,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:58,311 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-08 03:34:58,311 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 03:34:58,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:34:58,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:34:58,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-08 03:34:58,313 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-08 03:34:58,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:58,316 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-08 03:34:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 03:34:58,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:34:58,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:34:58,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:34:58,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:34:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:34:58,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-08 03:34:58,321 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 17 [2022-04-08 03:34:58,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:34:58,323 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-08 03:34:58,328 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:58,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-08 03:34:58,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:34:58,392 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 03:34:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 03:34:58,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:34:58,393 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:34:58,393 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:34:58,393 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:34:58,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:34:58,393 INFO L85 PathProgramCache]: Analyzing trace with hash -286620772, now seen corresponding path program 1 times [2022-04-08 03:34:58,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:58,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [651430267] [2022-04-08 03:34:58,394 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:34:58,394 INFO L85 PathProgramCache]: Analyzing trace with hash -286620772, now seen corresponding path program 2 times [2022-04-08 03:34:58,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:34:58,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385123409] [2022-04-08 03:34:58,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:34:58,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:34:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:34:58,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:34:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:34:58,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {288#true} is VALID [2022-04-08 03:34:58,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-08 03:34:58,480 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {288#true} {288#true} #107#return; {288#true} is VALID [2022-04-08 03:34:58,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {288#true} call ULTIMATE.init(); {294#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:34:58,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {288#true} is VALID [2022-04-08 03:34:58,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-08 03:34:58,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {288#true} {288#true} #107#return; {288#true} is VALID [2022-04-08 03:34:58,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {288#true} call #t~ret22 := main(); {288#true} is VALID [2022-04-08 03:34:58,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {288#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:34:58,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~i~0 < ~nodecount~0); {289#false} is VALID [2022-04-08 03:34:58,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {289#false} ~i~0 := 0; {289#false} is VALID [2022-04-08 03:34:58,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {289#false} assume !(~i~0 < ~nodecount~0); {289#false} is VALID [2022-04-08 03:34:58,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {289#false} ~i~0 := 0; {289#false} is VALID [2022-04-08 03:34:58,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {289#false} assume !(~i~0 < ~edgecount~0); {289#false} is VALID [2022-04-08 03:34:58,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {289#false} ~i~0 := 0; {289#false} is VALID [2022-04-08 03:34:58,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {289#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {289#false} is VALID [2022-04-08 03:34:58,485 INFO L272 TraceCheckUtils]: 13: Hoare triple {289#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {289#false} is VALID [2022-04-08 03:34:58,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {289#false} ~cond := #in~cond; {289#false} is VALID [2022-04-08 03:34:58,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {289#false} assume 0 == ~cond; {289#false} is VALID [2022-04-08 03:34:58,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {289#false} assume !false; {289#false} is VALID [2022-04-08 03:34:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:34:58,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:34:58,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385123409] [2022-04-08 03:34:58,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385123409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:34:58,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:34:58,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:34:58,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:34:58,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [651430267] [2022-04-08 03:34:58,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [651430267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:34:58,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:34:58,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:34:58,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467362925] [2022-04-08 03:34:58,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:34:58,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 03:34:58,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:34:58,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:58,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:34:58,501 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:34:58,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:58,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:34:58,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:34:58,501 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:58,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:58,684 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-04-08 03:34:58,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 03:34:58,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 03:34:58,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:34:58,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-04-08 03:34:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-04-08 03:34:58,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 66 transitions. [2022-04-08 03:34:58,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:34:58,744 INFO L225 Difference]: With dead ends: 54 [2022-04-08 03:34:58,744 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 03:34:58,744 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:34:58,759 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:34:58,760 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 38 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:34:58,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 03:34:58,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-04-08 03:34:58,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:34:58,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:34:58,765 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:34:58,765 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:34:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:58,767 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-08 03:34:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-08 03:34:58,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:34:58,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:34:58,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-08 03:34:58,768 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-08 03:34:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:58,777 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-08 03:34:58,777 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-08 03:34:58,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:34:58,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:34:58,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:34:58,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:34:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:34:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-04-08 03:34:58,779 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 17 [2022-04-08 03:34:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:34:58,779 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-04-08 03:34:58,780 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:58,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 37 transitions. [2022-04-08 03:34:58,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:34:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-04-08 03:34:58,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 03:34:58,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:34:58,821 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:34:58,821 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:34:58,821 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:34:58,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:34:58,822 INFO L85 PathProgramCache]: Analyzing trace with hash -344225220, now seen corresponding path program 1 times [2022-04-08 03:34:58,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:58,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1018106780] [2022-04-08 03:34:58,838 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:34:58,838 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:34:58,838 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:34:58,838 INFO L85 PathProgramCache]: Analyzing trace with hash -344225220, now seen corresponding path program 2 times [2022-04-08 03:34:58,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:34:58,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983636779] [2022-04-08 03:34:58,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:34:58,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:34:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:34:58,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:34:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:34:58,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {542#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {535#true} is VALID [2022-04-08 03:34:58,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {535#true} assume true; {535#true} is VALID [2022-04-08 03:34:58,947 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {535#true} {535#true} #107#return; {535#true} is VALID [2022-04-08 03:34:58,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {535#true} call ULTIMATE.init(); {542#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:34:58,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {535#true} is VALID [2022-04-08 03:34:58,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {535#true} assume true; {535#true} is VALID [2022-04-08 03:34:58,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {535#true} {535#true} #107#return; {535#true} is VALID [2022-04-08 03:34:58,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {535#true} call #t~ret22 := main(); {535#true} is VALID [2022-04-08 03:34:58,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {535#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {540#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:34:58,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {540#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {540#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:34:58,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {540#(= (+ main_~nodecount~0 (- 5)) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {540#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:34:58,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {540#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {540#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:34:58,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 < ~nodecount~0); {540#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:34:58,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {540#(= (+ main_~nodecount~0 (- 5)) 0)} ~i~0 := 0; {541#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:34:58,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {541#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~i~0 < ~nodecount~0); {536#false} is VALID [2022-04-08 03:34:58,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {536#false} ~i~0 := 0; {536#false} is VALID [2022-04-08 03:34:58,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {536#false} assume !(~i~0 < ~edgecount~0); {536#false} is VALID [2022-04-08 03:34:58,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {536#false} ~i~0 := 0; {536#false} is VALID [2022-04-08 03:34:58,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {536#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {536#false} is VALID [2022-04-08 03:34:58,957 INFO L272 TraceCheckUtils]: 16: Hoare triple {536#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {536#false} is VALID [2022-04-08 03:34:58,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {536#false} ~cond := #in~cond; {536#false} is VALID [2022-04-08 03:34:58,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {536#false} assume 0 == ~cond; {536#false} is VALID [2022-04-08 03:34:58,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {536#false} assume !false; {536#false} is VALID [2022-04-08 03:34:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 03:34:58,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:34:58,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983636779] [2022-04-08 03:34:58,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983636779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:34:58,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:34:58,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:34:58,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:34:58,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1018106780] [2022-04-08 03:34:58,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1018106780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:34:58,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:34:58,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:34:58,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228035036] [2022-04-08 03:34:58,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:34:58,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 03:34:58,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:34:58,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:58,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:34:58,975 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:34:58,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:58,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:34:58,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:34:58,976 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:59,176 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-08 03:34:59,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:34:59,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 03:34:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:34:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-08 03:34:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-08 03:34:59,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2022-04-08 03:34:59,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:34:59,242 INFO L225 Difference]: With dead ends: 61 [2022-04-08 03:34:59,243 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 03:34:59,243 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:34:59,244 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 90 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:34:59,244 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 29 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:34:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 03:34:59,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2022-04-08 03:34:59,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:34:59,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:34:59,251 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:34:59,251 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:34:59,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:59,253 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-08 03:34:59,253 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-08 03:34:59,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:34:59,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:34:59,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 46 states. [2022-04-08 03:34:59,254 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 46 states. [2022-04-08 03:34:59,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:59,256 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-08 03:34:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-08 03:34:59,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:34:59,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:34:59,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:34:59,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:34:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:34:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-08 03:34:59,258 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 20 [2022-04-08 03:34:59,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:34:59,258 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-08 03:34:59,258 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:59,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-08 03:34:59,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:34:59,301 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 03:34:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 03:34:59,303 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:34:59,303 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:34:59,303 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 03:34:59,305 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:34:59,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:34:59,306 INFO L85 PathProgramCache]: Analyzing trace with hash -522475142, now seen corresponding path program 1 times [2022-04-08 03:34:59,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:59,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1917660126] [2022-04-08 03:34:59,313 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:34:59,313 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:34:59,313 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:34:59,313 INFO L85 PathProgramCache]: Analyzing trace with hash -522475142, now seen corresponding path program 2 times [2022-04-08 03:34:59,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:34:59,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124326431] [2022-04-08 03:34:59,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:34:59,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:34:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:34:59,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:34:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:34:59,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {834#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {827#true} is VALID [2022-04-08 03:34:59,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-08 03:34:59,400 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {827#true} {827#true} #107#return; {827#true} is VALID [2022-04-08 03:34:59,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {827#true} call ULTIMATE.init(); {834#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:34:59,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {827#true} is VALID [2022-04-08 03:34:59,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-08 03:34:59,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} #107#return; {827#true} is VALID [2022-04-08 03:34:59,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {827#true} call #t~ret22 := main(); {827#true} is VALID [2022-04-08 03:34:59,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {827#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {832#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {832#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {832#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {832#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {832#(<= 20 main_~edgecount~0)} ~i~0 := 0; {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {832#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {833#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:34:59,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {833#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !(~j~0 < ~edgecount~0); {828#false} is VALID [2022-04-08 03:34:59,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {828#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {828#false} is VALID [2022-04-08 03:34:59,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {828#false} assume !(~i~0 < ~nodecount~0); {828#false} is VALID [2022-04-08 03:34:59,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {828#false} ~i~0 := 0; {828#false} is VALID [2022-04-08 03:34:59,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {828#false} assume !(~i~0 < ~edgecount~0); {828#false} is VALID [2022-04-08 03:34:59,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {828#false} ~i~0 := 0; {828#false} is VALID [2022-04-08 03:34:59,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {828#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {828#false} is VALID [2022-04-08 03:34:59,406 INFO L272 TraceCheckUtils]: 19: Hoare triple {828#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {828#false} is VALID [2022-04-08 03:34:59,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {828#false} ~cond := #in~cond; {828#false} is VALID [2022-04-08 03:34:59,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {828#false} assume 0 == ~cond; {828#false} is VALID [2022-04-08 03:34:59,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {828#false} assume !false; {828#false} is VALID [2022-04-08 03:34:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 03:34:59,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:34:59,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124326431] [2022-04-08 03:34:59,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124326431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:34:59,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:34:59,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:34:59,408 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:34:59,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1917660126] [2022-04-08 03:34:59,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1917660126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:34:59,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:34:59,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:34:59,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251090955] [2022-04-08 03:34:59,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:34:59,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 03:34:59,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:34:59,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:59,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:34:59,427 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:34:59,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:59,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:34:59,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:34:59,428 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:59,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:59,593 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2022-04-08 03:34:59,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:34:59,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 03:34:59,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:34:59,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 03:34:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 03:34:59,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 03:34:59,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:34:59,653 INFO L225 Difference]: With dead ends: 55 [2022-04-08 03:34:59,653 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 03:34:59,653 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:34:59,654 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 56 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:34:59,654 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 35 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:34:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 03:34:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-04-08 03:34:59,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:34:59,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:34:59,670 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:34:59,670 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:34:59,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:59,671 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-08 03:34:59,671 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-08 03:34:59,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:34:59,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:34:59,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-08 03:34:59,672 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-08 03:34:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:59,673 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-08 03:34:59,673 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-08 03:34:59,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:34:59,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:34:59,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:34:59,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:34:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:34:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-08 03:34:59,675 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 23 [2022-04-08 03:34:59,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:34:59,675 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-08 03:34:59,675 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:59,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 39 transitions. [2022-04-08 03:34:59,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:34:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-08 03:34:59,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 03:34:59,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:34:59,740 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:34:59,741 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 03:34:59,741 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:34:59,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:34:59,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1086024003, now seen corresponding path program 1 times [2022-04-08 03:34:59,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:59,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [649011236] [2022-04-08 03:34:59,743 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:34:59,743 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:34:59,743 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:34:59,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1086024003, now seen corresponding path program 2 times [2022-04-08 03:34:59,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:34:59,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254472982] [2022-04-08 03:34:59,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:34:59,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:34:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:34:59,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:34:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:34:59,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {1094#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1087#true} is VALID [2022-04-08 03:34:59,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {1087#true} assume true; {1087#true} is VALID [2022-04-08 03:34:59,800 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1087#true} {1087#true} #107#return; {1087#true} is VALID [2022-04-08 03:34:59,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {1087#true} call ULTIMATE.init(); {1094#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:34:59,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {1094#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1087#true} is VALID [2022-04-08 03:34:59,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {1087#true} assume true; {1087#true} is VALID [2022-04-08 03:34:59,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1087#true} {1087#true} #107#return; {1087#true} is VALID [2022-04-08 03:34:59,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {1087#true} call #t~ret22 := main(); {1087#true} is VALID [2022-04-08 03:34:59,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {1087#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {1092#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {1092#(<= 20 main_~edgecount~0)} ~i~0 := 0; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {1092#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {1092#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:34:59,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {1092#(<= 20 main_~edgecount~0)} ~i~0 := 0; {1093#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 03:34:59,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {1093#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !(~i~0 < ~edgecount~0); {1088#false} is VALID [2022-04-08 03:34:59,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {1088#false} ~i~0 := 0; {1088#false} is VALID [2022-04-08 03:34:59,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {1088#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1088#false} is VALID [2022-04-08 03:34:59,811 INFO L272 TraceCheckUtils]: 22: Hoare triple {1088#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1088#false} is VALID [2022-04-08 03:34:59,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {1088#false} ~cond := #in~cond; {1088#false} is VALID [2022-04-08 03:34:59,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {1088#false} assume 0 == ~cond; {1088#false} is VALID [2022-04-08 03:34:59,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {1088#false} assume !false; {1088#false} is VALID [2022-04-08 03:34:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 03:34:59,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:34:59,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254472982] [2022-04-08 03:34:59,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254472982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:34:59,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:34:59,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:34:59,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:34:59,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [649011236] [2022-04-08 03:34:59,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [649011236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:34:59,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:34:59,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:34:59,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812505127] [2022-04-08 03:34:59,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:34:59,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 03:34:59,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:34:59,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:34:59,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:34:59,838 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:34:59,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:59,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:34:59,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:34:59,839 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:00,016 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-08 03:35:00,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:35:00,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 03:35:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 03:35:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 03:35:00,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 03:35:00,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:00,093 INFO L225 Difference]: With dead ends: 58 [2022-04-08 03:35:00,093 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 03:35:00,093 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:35:00,094 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 72 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:00,094 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 29 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 03:35:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2022-04-08 03:35:00,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:00,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:00,110 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:00,110 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:00,111 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-08 03:35:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-08 03:35:00,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:00,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:00,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 47 states. [2022-04-08 03:35:00,112 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 47 states. [2022-04-08 03:35:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:00,113 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-08 03:35:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-08 03:35:00,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:00,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:00,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:00,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-04-08 03:35:00,114 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 26 [2022-04-08 03:35:00,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:00,114 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-04-08 03:35:00,114 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:00,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 40 transitions. [2022-04-08 03:35:00,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-08 03:35:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 03:35:00,155 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:00,156 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:00,156 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 03:35:00,156 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:00,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:00,156 INFO L85 PathProgramCache]: Analyzing trace with hash -669976079, now seen corresponding path program 1 times [2022-04-08 03:35:00,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:00,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1130237607] [2022-04-08 03:35:00,158 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:00,159 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:00,159 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:00,159 INFO L85 PathProgramCache]: Analyzing trace with hash -669976079, now seen corresponding path program 2 times [2022-04-08 03:35:00,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:00,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986152682] [2022-04-08 03:35:00,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:00,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:00,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:00,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {1386#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1379#true} is VALID [2022-04-08 03:35:00,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-08 03:35:00,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1379#true} {1379#true} #107#return; {1379#true} is VALID [2022-04-08 03:35:00,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1386#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:00,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {1386#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1379#true} is VALID [2022-04-08 03:35:00,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-08 03:35:00,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #107#return; {1379#true} is VALID [2022-04-08 03:35:00,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret22 := main(); {1379#true} is VALID [2022-04-08 03:35:00,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1384#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:00,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {1384#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {1384#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:00,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {1384#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1384#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:00,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {1384#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1385#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:00,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {1385#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 < ~nodecount~0); {1380#false} is VALID [2022-04-08 03:35:00,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-08 03:35:00,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {1380#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1380#false} is VALID [2022-04-08 03:35:00,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {1380#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1380#false} is VALID [2022-04-08 03:35:00,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {1380#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1380#false} is VALID [2022-04-08 03:35:00,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {1380#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1380#false} is VALID [2022-04-08 03:35:00,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {1380#false} assume !(~j~0 < ~edgecount~0); {1380#false} is VALID [2022-04-08 03:35:00,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {1380#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1380#false} is VALID [2022-04-08 03:35:00,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {1380#false} assume !(~i~0 < ~nodecount~0); {1380#false} is VALID [2022-04-08 03:35:00,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-08 03:35:00,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {1380#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-08 03:35:00,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {1380#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1380#false} is VALID [2022-04-08 03:35:00,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {1380#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1380#false} is VALID [2022-04-08 03:35:00,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#false} assume !(~i~0 < ~edgecount~0); {1380#false} is VALID [2022-04-08 03:35:00,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-08 03:35:00,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {1380#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-08 03:35:00,231 INFO L272 TraceCheckUtils]: 25: Hoare triple {1380#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1380#false} is VALID [2022-04-08 03:35:00,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-08 03:35:00,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-08 03:35:00,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-08 03:35:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 03:35:00,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:00,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986152682] [2022-04-08 03:35:00,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986152682] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:00,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560765380] [2022-04-08 03:35:00,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:00,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:00,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:00,236 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:00,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 03:35:00,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:00,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:00,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 03:35:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:00,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:00,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-08 03:35:00,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1379#true} is VALID [2022-04-08 03:35:00,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-08 03:35:00,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #107#return; {1379#true} is VALID [2022-04-08 03:35:00,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret22 := main(); {1379#true} is VALID [2022-04-08 03:35:00,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1405#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:00,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {1405#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {1405#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:00,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {1405#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1405#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:00,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {1405#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1405#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:00,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {1405#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1405#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:00,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {1405#(<= 5 main_~nodecount~0)} ~i~0 := 0; {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:00,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:00,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:00,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:00,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:00,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:00,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1440#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:00,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {1380#false} is VALID [2022-04-08 03:35:00,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-08 03:35:00,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {1380#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-08 03:35:00,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {1380#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1380#false} is VALID [2022-04-08 03:35:00,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {1380#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1380#false} is VALID [2022-04-08 03:35:00,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#false} assume !(~i~0 < ~edgecount~0); {1380#false} is VALID [2022-04-08 03:35:00,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-08 03:35:00,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {1380#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-08 03:35:00,535 INFO L272 TraceCheckUtils]: 25: Hoare triple {1380#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1380#false} is VALID [2022-04-08 03:35:00,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-08 03:35:00,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-08 03:35:00,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-08 03:35:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 03:35:00,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:00,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-08 03:35:00,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-08 03:35:00,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-08 03:35:00,698 INFO L272 TraceCheckUtils]: 25: Hoare triple {1380#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1380#false} is VALID [2022-04-08 03:35:00,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {1380#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-08 03:35:00,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-08 03:35:00,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#false} assume !(~i~0 < ~edgecount~0); {1380#false} is VALID [2022-04-08 03:35:00,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {1380#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1380#false} is VALID [2022-04-08 03:35:00,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {1380#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1380#false} is VALID [2022-04-08 03:35:00,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {1380#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-08 03:35:00,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-08 03:35:00,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {1510#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1380#false} is VALID [2022-04-08 03:35:00,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {1514#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1510#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-08 03:35:00,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {1514#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {1514#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:00,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {1514#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1514#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:00,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {1514#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1514#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:00,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {1514#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1514#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:00,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {1514#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1514#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:00,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {1533#(< 1 main_~nodecount~0)} ~i~0 := 0; {1514#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:00,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {1533#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1533#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:00,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {1533#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1533#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:00,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {1533#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1533#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:00,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {1533#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {1533#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:00,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1533#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:00,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret22 := main(); {1379#true} is VALID [2022-04-08 03:35:00,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #107#return; {1379#true} is VALID [2022-04-08 03:35:00,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-08 03:35:00,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1379#true} is VALID [2022-04-08 03:35:00,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-08 03:35:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 03:35:00,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560765380] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:00,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:00,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-08 03:35:00,706 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:00,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1130237607] [2022-04-08 03:35:00,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1130237607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:00,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:00,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:35:00,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106228556] [2022-04-08 03:35:00,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:00,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 03:35:00,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:00,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:00,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:00,727 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:35:00,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:00,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:35:00,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-08 03:35:00,727 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:00,904 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-08 03:35:00,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:35:00,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 03:35:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-08 03:35:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-08 03:35:00,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-08 03:35:00,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:00,965 INFO L225 Difference]: With dead ends: 63 [2022-04-08 03:35:00,965 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 03:35:00,966 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-04-08 03:35:00,966 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:00,966 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 43 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:00,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 03:35:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-04-08 03:35:00,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:00,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:00,984 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:00,985 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:00,985 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-08 03:35:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-04-08 03:35:00,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:00,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:00,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 39 states. [2022-04-08 03:35:00,986 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 39 states. [2022-04-08 03:35:00,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:00,987 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-08 03:35:00,987 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-04-08 03:35:00,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:00,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:00,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:00,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-04-08 03:35:00,988 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 29 [2022-04-08 03:35:00,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:00,988 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-04-08 03:35:00,988 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:00,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 44 transitions. [2022-04-08 03:35:01,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:01,032 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-08 03:35:01,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 03:35:01,033 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:01,033 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:01,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:01,246 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-08 03:35:01,246 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:01,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:01,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1490218863, now seen corresponding path program 3 times [2022-04-08 03:35:01,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:01,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [562021691] [2022-04-08 03:35:01,251 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:01,252 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:01,252 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:01,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1490218863, now seen corresponding path program 4 times [2022-04-08 03:35:01,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:01,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952776570] [2022-04-08 03:35:01,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:01,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:01,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:01,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {1855#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1848#true} is VALID [2022-04-08 03:35:01,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {1848#true} assume true; {1848#true} is VALID [2022-04-08 03:35:01,325 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1848#true} {1848#true} #107#return; {1848#true} is VALID [2022-04-08 03:35:01,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {1848#true} call ULTIMATE.init(); {1855#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:01,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {1855#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1848#true} is VALID [2022-04-08 03:35:01,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {1848#true} assume true; {1848#true} is VALID [2022-04-08 03:35:01,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1848#true} {1848#true} #107#return; {1848#true} is VALID [2022-04-08 03:35:01,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {1848#true} call #t~ret22 := main(); {1848#true} is VALID [2022-04-08 03:35:01,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {1848#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1853#(and (= main_~source~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:01,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {1853#(and (= main_~source~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {1853#(and (= main_~source~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:01,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {1853#(and (= main_~source~0 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1853#(and (= main_~source~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:01,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {1853#(and (= main_~source~0 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1854#(and (= main_~source~0 0) (not (= main_~i~0 0)))} is VALID [2022-04-08 03:35:01,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {1854#(and (= main_~source~0 0) (not (= main_~i~0 0)))} assume !!(~i~0 < ~nodecount~0); {1854#(and (= main_~source~0 0) (not (= main_~i~0 0)))} is VALID [2022-04-08 03:35:01,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {1854#(and (= main_~source~0 0) (not (= main_~i~0 0)))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1849#false} is VALID [2022-04-08 03:35:01,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {1849#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1849#false} is VALID [2022-04-08 03:35:01,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {1849#false} assume !(~i~0 < ~nodecount~0); {1849#false} is VALID [2022-04-08 03:35:01,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-08 03:35:01,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {1849#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1849#false} is VALID [2022-04-08 03:35:01,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {1849#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1849#false} is VALID [2022-04-08 03:35:01,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {1849#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1849#false} is VALID [2022-04-08 03:35:01,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {1849#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1849#false} is VALID [2022-04-08 03:35:01,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {1849#false} assume !(~j~0 < ~edgecount~0); {1849#false} is VALID [2022-04-08 03:35:01,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {1849#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1849#false} is VALID [2022-04-08 03:35:01,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {1849#false} assume !(~i~0 < ~nodecount~0); {1849#false} is VALID [2022-04-08 03:35:01,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-08 03:35:01,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {1849#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {1849#false} is VALID [2022-04-08 03:35:01,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {1849#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1849#false} is VALID [2022-04-08 03:35:01,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {1849#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1849#false} is VALID [2022-04-08 03:35:01,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {1849#false} assume !(~i~0 < ~edgecount~0); {1849#false} is VALID [2022-04-08 03:35:01,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-08 03:35:01,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {1849#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1849#false} is VALID [2022-04-08 03:35:01,334 INFO L272 TraceCheckUtils]: 28: Hoare triple {1849#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1849#false} is VALID [2022-04-08 03:35:01,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {1849#false} ~cond := #in~cond; {1849#false} is VALID [2022-04-08 03:35:01,335 INFO L290 TraceCheckUtils]: 30: Hoare triple {1849#false} assume 0 == ~cond; {1849#false} is VALID [2022-04-08 03:35:01,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {1849#false} assume !false; {1849#false} is VALID [2022-04-08 03:35:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 03:35:01,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:01,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952776570] [2022-04-08 03:35:01,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952776570] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:01,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970142864] [2022-04-08 03:35:01,337 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:35:01,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:01,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:01,338 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:01,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 03:35:01,402 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:35:01,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:01,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 03:35:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:01,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:01,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {1848#true} call ULTIMATE.init(); {1848#true} is VALID [2022-04-08 03:35:01,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {1848#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1848#true} is VALID [2022-04-08 03:35:01,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {1848#true} assume true; {1848#true} is VALID [2022-04-08 03:35:01,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1848#true} {1848#true} #107#return; {1848#true} is VALID [2022-04-08 03:35:01,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {1848#true} call #t~ret22 := main(); {1848#true} is VALID [2022-04-08 03:35:01,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {1848#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1848#true} is VALID [2022-04-08 03:35:01,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {1848#true} assume !!(~i~0 < ~nodecount~0); {1848#true} is VALID [2022-04-08 03:35:01,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {1848#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1880#(<= main_~source~0 main_~i~0)} is VALID [2022-04-08 03:35:01,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {1880#(<= main_~source~0 main_~i~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1884#(<= (+ main_~source~0 1) main_~i~0)} is VALID [2022-04-08 03:35:01,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {1884#(<= (+ main_~source~0 1) main_~i~0)} assume !!(~i~0 < ~nodecount~0); {1884#(<= (+ main_~source~0 1) main_~i~0)} is VALID [2022-04-08 03:35:01,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {1884#(<= (+ main_~source~0 1) main_~i~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1849#false} is VALID [2022-04-08 03:35:01,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {1849#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1849#false} is VALID [2022-04-08 03:35:01,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {1849#false} assume !(~i~0 < ~nodecount~0); {1849#false} is VALID [2022-04-08 03:35:01,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-08 03:35:01,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {1849#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1849#false} is VALID [2022-04-08 03:35:01,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {1849#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1849#false} is VALID [2022-04-08 03:35:01,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {1849#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1849#false} is VALID [2022-04-08 03:35:01,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {1849#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1849#false} is VALID [2022-04-08 03:35:01,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {1849#false} assume !(~j~0 < ~edgecount~0); {1849#false} is VALID [2022-04-08 03:35:01,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {1849#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1849#false} is VALID [2022-04-08 03:35:01,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {1849#false} assume !(~i~0 < ~nodecount~0); {1849#false} is VALID [2022-04-08 03:35:01,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-08 03:35:01,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {1849#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {1849#false} is VALID [2022-04-08 03:35:01,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {1849#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1849#false} is VALID [2022-04-08 03:35:01,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {1849#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1849#false} is VALID [2022-04-08 03:35:01,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {1849#false} assume !(~i~0 < ~edgecount~0); {1849#false} is VALID [2022-04-08 03:35:01,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-08 03:35:01,501 INFO L290 TraceCheckUtils]: 27: Hoare triple {1849#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1849#false} is VALID [2022-04-08 03:35:01,502 INFO L272 TraceCheckUtils]: 28: Hoare triple {1849#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1849#false} is VALID [2022-04-08 03:35:01,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {1849#false} ~cond := #in~cond; {1849#false} is VALID [2022-04-08 03:35:01,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {1849#false} assume 0 == ~cond; {1849#false} is VALID [2022-04-08 03:35:01,502 INFO L290 TraceCheckUtils]: 31: Hoare triple {1849#false} assume !false; {1849#false} is VALID [2022-04-08 03:35:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 03:35:01,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 03:35:01,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970142864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:01,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 03:35:01,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-04-08 03:35:01,503 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:01,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [562021691] [2022-04-08 03:35:01,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [562021691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:01,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:01,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:35:01,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771446819] [2022-04-08 03:35:01,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:01,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 03:35:01,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:01,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:01,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:01,527 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:35:01,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:01,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:35:01,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:35:01,528 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:01,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:01,643 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-08 03:35:01,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 03:35:01,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 03:35:01,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-08 03:35:01,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:01,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-08 03:35:01,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-04-08 03:35:01,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:01,689 INFO L225 Difference]: With dead ends: 65 [2022-04-08 03:35:01,689 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 03:35:01,690 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:35:01,690 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:01,690 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:35:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 03:35:01,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-08 03:35:01,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:01,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:01,712 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:01,712 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:01,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:01,713 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-04-08 03:35:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-08 03:35:01,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:01,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:01,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 38 states. [2022-04-08 03:35:01,714 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 38 states. [2022-04-08 03:35:01,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:01,715 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-04-08 03:35:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-08 03:35:01,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:01,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:01,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:01,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:01,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-04-08 03:35:01,716 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 32 [2022-04-08 03:35:01,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:01,716 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-04-08 03:35:01,716 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:01,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 43 transitions. [2022-04-08 03:35:01,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-08 03:35:01,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 03:35:01,755 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:01,755 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:01,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:01,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-04-08 03:35:01,972 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:01,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:01,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1271364145, now seen corresponding path program 1 times [2022-04-08 03:35:01,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:01,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1099552151] [2022-04-08 03:35:01,976 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:01,976 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:01,976 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:01,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1271364145, now seen corresponding path program 2 times [2022-04-08 03:35:01,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:01,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461721592] [2022-04-08 03:35:01,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:01,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:02,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {2241#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2233#true} is VALID [2022-04-08 03:35:02,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} assume true; {2233#true} is VALID [2022-04-08 03:35:02,076 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2233#true} {2233#true} #107#return; {2233#true} is VALID [2022-04-08 03:35:02,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {2233#true} call ULTIMATE.init(); {2241#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:02,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {2241#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2233#true} is VALID [2022-04-08 03:35:02,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {2233#true} assume true; {2233#true} is VALID [2022-04-08 03:35:02,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2233#true} {2233#true} #107#return; {2233#true} is VALID [2022-04-08 03:35:02,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {2233#true} call #t~ret22 := main(); {2233#true} is VALID [2022-04-08 03:35:02,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {2233#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2238#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:02,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {2238#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {2238#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:02,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {2238#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2238#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:02,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {2238#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2239#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:02,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {2239#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0); {2239#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:02,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {2239#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2239#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:02,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {2239#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2240#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:02,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {2240#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-08 03:35:02,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-08 03:35:02,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2234#false} is VALID [2022-04-08 03:35:02,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {2234#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2234#false} is VALID [2022-04-08 03:35:02,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {2234#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2234#false} is VALID [2022-04-08 03:35:02,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {2234#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2234#false} is VALID [2022-04-08 03:35:02,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {2234#false} assume !(~j~0 < ~edgecount~0); {2234#false} is VALID [2022-04-08 03:35:02,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {2234#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2234#false} is VALID [2022-04-08 03:35:02,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {2234#false} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-08 03:35:02,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-08 03:35:02,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {2234#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2234#false} is VALID [2022-04-08 03:35:02,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {2234#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2234#false} is VALID [2022-04-08 03:35:02,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {2234#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2234#false} is VALID [2022-04-08 03:35:02,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {2234#false} assume !(~i~0 < ~edgecount~0); {2234#false} is VALID [2022-04-08 03:35:02,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-08 03:35:02,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2234#false} is VALID [2022-04-08 03:35:02,085 INFO L272 TraceCheckUtils]: 28: Hoare triple {2234#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2234#false} is VALID [2022-04-08 03:35:02,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {2234#false} ~cond := #in~cond; {2234#false} is VALID [2022-04-08 03:35:02,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {2234#false} assume 0 == ~cond; {2234#false} is VALID [2022-04-08 03:35:02,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {2234#false} assume !false; {2234#false} is VALID [2022-04-08 03:35:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 03:35:02,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:02,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461721592] [2022-04-08 03:35:02,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461721592] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:02,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083573741] [2022-04-08 03:35:02,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:02,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:02,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:02,100 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:02,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 03:35:02,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:02,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:02,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 03:35:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:02,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:02,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {2233#true} call ULTIMATE.init(); {2233#true} is VALID [2022-04-08 03:35:02,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2233#true} is VALID [2022-04-08 03:35:02,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {2233#true} assume true; {2233#true} is VALID [2022-04-08 03:35:02,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2233#true} {2233#true} #107#return; {2233#true} is VALID [2022-04-08 03:35:02,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {2233#true} call #t~ret22 := main(); {2233#true} is VALID [2022-04-08 03:35:02,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {2233#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2260#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:02,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {2260#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {2260#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:02,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {2260#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2260#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:02,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {2260#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2270#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:02,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {2270#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {2270#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:02,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {2270#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2270#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:02,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {2270#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2280#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:02,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {2280#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-08 03:35:02,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-08 03:35:02,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2234#false} is VALID [2022-04-08 03:35:02,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {2234#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2234#false} is VALID [2022-04-08 03:35:02,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {2234#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2234#false} is VALID [2022-04-08 03:35:02,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {2234#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2234#false} is VALID [2022-04-08 03:35:02,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {2234#false} assume !(~j~0 < ~edgecount~0); {2234#false} is VALID [2022-04-08 03:35:02,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {2234#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2234#false} is VALID [2022-04-08 03:35:02,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {2234#false} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-08 03:35:02,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-08 03:35:02,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {2234#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2234#false} is VALID [2022-04-08 03:35:02,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {2234#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2234#false} is VALID [2022-04-08 03:35:02,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {2234#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2234#false} is VALID [2022-04-08 03:35:02,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {2234#false} assume !(~i~0 < ~edgecount~0); {2234#false} is VALID [2022-04-08 03:35:02,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-08 03:35:02,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2234#false} is VALID [2022-04-08 03:35:02,358 INFO L272 TraceCheckUtils]: 28: Hoare triple {2234#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2234#false} is VALID [2022-04-08 03:35:02,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {2234#false} ~cond := #in~cond; {2234#false} is VALID [2022-04-08 03:35:02,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {2234#false} assume 0 == ~cond; {2234#false} is VALID [2022-04-08 03:35:02,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {2234#false} assume !false; {2234#false} is VALID [2022-04-08 03:35:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 03:35:02,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:02,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {2234#false} assume !false; {2234#false} is VALID [2022-04-08 03:35:02,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {2234#false} assume 0 == ~cond; {2234#false} is VALID [2022-04-08 03:35:02,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {2234#false} ~cond := #in~cond; {2234#false} is VALID [2022-04-08 03:35:02,499 INFO L272 TraceCheckUtils]: 28: Hoare triple {2234#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2234#false} is VALID [2022-04-08 03:35:02,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2234#false} is VALID [2022-04-08 03:35:02,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-08 03:35:02,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {2234#false} assume !(~i~0 < ~edgecount~0); {2234#false} is VALID [2022-04-08 03:35:02,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {2234#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2234#false} is VALID [2022-04-08 03:35:02,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {2234#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2234#false} is VALID [2022-04-08 03:35:02,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {2234#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2234#false} is VALID [2022-04-08 03:35:02,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-08 03:35:02,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {2234#false} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-08 03:35:02,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {2234#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2234#false} is VALID [2022-04-08 03:35:02,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {2234#false} assume !(~j~0 < ~edgecount~0); {2234#false} is VALID [2022-04-08 03:35:02,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {2234#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2234#false} is VALID [2022-04-08 03:35:02,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {2234#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2234#false} is VALID [2022-04-08 03:35:02,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {2234#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2234#false} is VALID [2022-04-08 03:35:02,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2234#false} is VALID [2022-04-08 03:35:02,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-08 03:35:02,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {2398#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-08 03:35:02,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {2402#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2398#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-08 03:35:02,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {2402#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2402#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:02,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {2402#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2402#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:02,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {2412#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2402#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:02,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {2412#(< (+ main_~i~0 2) main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2412#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:35:02,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {2412#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2412#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:35:02,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {2233#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2412#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:35:02,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {2233#true} call #t~ret22 := main(); {2233#true} is VALID [2022-04-08 03:35:02,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2233#true} {2233#true} #107#return; {2233#true} is VALID [2022-04-08 03:35:02,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {2233#true} assume true; {2233#true} is VALID [2022-04-08 03:35:02,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2233#true} is VALID [2022-04-08 03:35:02,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {2233#true} call ULTIMATE.init(); {2233#true} is VALID [2022-04-08 03:35:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 03:35:02,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083573741] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:02,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:02,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-04-08 03:35:02,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:02,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1099552151] [2022-04-08 03:35:02,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1099552151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:02,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:02,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:35:02,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97657330] [2022-04-08 03:35:02,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:02,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 03:35:02,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:02,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:02,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:02,545 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:35:02,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:02,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:35:02,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2022-04-08 03:35:02,546 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:02,796 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-08 03:35:02,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:35:02,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 03:35:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-08 03:35:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-08 03:35:02,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-08 03:35:02,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:02,863 INFO L225 Difference]: With dead ends: 66 [2022-04-08 03:35:02,863 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 03:35:02,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=123, Unknown=0, NotChecked=0, Total=210 [2022-04-08 03:35:02,863 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 42 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:02,864 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 48 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 03:35:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-04-08 03:35:02,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:02,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:02,897 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:02,898 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:02,899 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-04-08 03:35:02,899 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-08 03:35:02,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:02,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:02,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 42 states. [2022-04-08 03:35:02,899 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 42 states. [2022-04-08 03:35:02,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:02,900 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-04-08 03:35:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-08 03:35:02,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:02,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:02,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:02,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:02,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:02,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-04-08 03:35:02,901 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 32 [2022-04-08 03:35:02,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:02,901 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-04-08 03:35:02,901 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:02,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 46 transitions. [2022-04-08 03:35:02,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-04-08 03:35:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 03:35:02,947 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:02,947 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:02,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:03,148 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:03,148 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:03,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:03,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1380320561, now seen corresponding path program 3 times [2022-04-08 03:35:03,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:03,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1794572718] [2022-04-08 03:35:03,154 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:03,154 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:03,154 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:03,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1380320561, now seen corresponding path program 4 times [2022-04-08 03:35:03,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:03,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895109417] [2022-04-08 03:35:03,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:03,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:03,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:03,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {2750#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2741#true} is VALID [2022-04-08 03:35:03,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {2741#true} assume true; {2741#true} is VALID [2022-04-08 03:35:03,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2741#true} {2741#true} #107#return; {2741#true} is VALID [2022-04-08 03:35:03,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {2741#true} call ULTIMATE.init(); {2750#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:03,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {2750#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2741#true} is VALID [2022-04-08 03:35:03,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {2741#true} assume true; {2741#true} is VALID [2022-04-08 03:35:03,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2741#true} {2741#true} #107#return; {2741#true} is VALID [2022-04-08 03:35:03,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {2741#true} call #t~ret22 := main(); {2741#true} is VALID [2022-04-08 03:35:03,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {2741#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2746#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:03,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {2746#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {2746#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:03,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {2746#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2746#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:03,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {2746#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2747#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:03,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {2747#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0); {2747#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:03,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {2747#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2747#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:03,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {2747#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2748#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:03,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {2748#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~nodecount~0); {2748#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:03,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {2748#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2748#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:03,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {2748#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2749#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:35:03,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {2749#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !(~i~0 < ~nodecount~0); {2742#false} is VALID [2022-04-08 03:35:03,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-08 03:35:03,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {2742#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2742#false} is VALID [2022-04-08 03:35:03,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {2742#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2742#false} is VALID [2022-04-08 03:35:03,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {2742#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2742#false} is VALID [2022-04-08 03:35:03,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {2742#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2742#false} is VALID [2022-04-08 03:35:03,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {2742#false} assume !(~j~0 < ~edgecount~0); {2742#false} is VALID [2022-04-08 03:35:03,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {2742#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2742#false} is VALID [2022-04-08 03:35:03,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {2742#false} assume !(~i~0 < ~nodecount~0); {2742#false} is VALID [2022-04-08 03:35:03,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-08 03:35:03,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {2742#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2742#false} is VALID [2022-04-08 03:35:03,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {2742#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2742#false} is VALID [2022-04-08 03:35:03,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {2742#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2742#false} is VALID [2022-04-08 03:35:03,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {2742#false} assume !(~i~0 < ~edgecount~0); {2742#false} is VALID [2022-04-08 03:35:03,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-08 03:35:03,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {2742#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2742#false} is VALID [2022-04-08 03:35:03,251 INFO L272 TraceCheckUtils]: 31: Hoare triple {2742#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2742#false} is VALID [2022-04-08 03:35:03,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {2742#false} ~cond := #in~cond; {2742#false} is VALID [2022-04-08 03:35:03,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {2742#false} assume 0 == ~cond; {2742#false} is VALID [2022-04-08 03:35:03,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {2742#false} assume !false; {2742#false} is VALID [2022-04-08 03:35:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 03:35:03,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:03,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895109417] [2022-04-08 03:35:03,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895109417] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:03,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83307926] [2022-04-08 03:35:03,252 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:35:03,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:03,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:03,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:03,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 03:35:03,372 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:35:03,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:03,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 03:35:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:03,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:03,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {2741#true} call ULTIMATE.init(); {2741#true} is VALID [2022-04-08 03:35:03,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {2741#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2741#true} is VALID [2022-04-08 03:35:03,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {2741#true} assume true; {2741#true} is VALID [2022-04-08 03:35:03,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2741#true} {2741#true} #107#return; {2741#true} is VALID [2022-04-08 03:35:03,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {2741#true} call #t~ret22 := main(); {2741#true} is VALID [2022-04-08 03:35:03,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {2741#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {2769#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {2769#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {2769#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {2769#(<= 5 main_~nodecount~0)} ~i~0 := 0; {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:03,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:03,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:03,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:03,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:03,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:03,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2822#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:03,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {2822#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {2742#false} is VALID [2022-04-08 03:35:03,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-08 03:35:03,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {2742#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2742#false} is VALID [2022-04-08 03:35:03,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {2742#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2742#false} is VALID [2022-04-08 03:35:03,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {2742#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2742#false} is VALID [2022-04-08 03:35:03,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {2742#false} assume !(~i~0 < ~edgecount~0); {2742#false} is VALID [2022-04-08 03:35:03,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-08 03:35:03,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {2742#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2742#false} is VALID [2022-04-08 03:35:03,558 INFO L272 TraceCheckUtils]: 31: Hoare triple {2742#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2742#false} is VALID [2022-04-08 03:35:03,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {2742#false} ~cond := #in~cond; {2742#false} is VALID [2022-04-08 03:35:03,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {2742#false} assume 0 == ~cond; {2742#false} is VALID [2022-04-08 03:35:03,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {2742#false} assume !false; {2742#false} is VALID [2022-04-08 03:35:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-08 03:35:03,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:03,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {2742#false} assume !false; {2742#false} is VALID [2022-04-08 03:35:03,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {2742#false} assume 0 == ~cond; {2742#false} is VALID [2022-04-08 03:35:03,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {2742#false} ~cond := #in~cond; {2742#false} is VALID [2022-04-08 03:35:03,719 INFO L272 TraceCheckUtils]: 31: Hoare triple {2742#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2742#false} is VALID [2022-04-08 03:35:03,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {2742#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2742#false} is VALID [2022-04-08 03:35:03,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-08 03:35:03,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {2742#false} assume !(~i~0 < ~edgecount~0); {2742#false} is VALID [2022-04-08 03:35:03,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {2742#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2742#false} is VALID [2022-04-08 03:35:03,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {2742#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2742#false} is VALID [2022-04-08 03:35:03,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {2742#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2742#false} is VALID [2022-04-08 03:35:03,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-08 03:35:03,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {2892#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2742#false} is VALID [2022-04-08 03:35:03,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {2896#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2892#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {2896#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {2896#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:03,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {2896#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2896#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:03,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {2896#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2896#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:03,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {2896#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2896#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:03,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {2896#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2896#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:03,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {2915#(< 1 main_~nodecount~0)} ~i~0 := 0; {2896#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:03,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {2915#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {2915#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {2915#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {2915#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {2915#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {2915#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {2915#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {2915#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {2915#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {2915#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {2741#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:03,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {2741#true} call #t~ret22 := main(); {2741#true} is VALID [2022-04-08 03:35:03,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2741#true} {2741#true} #107#return; {2741#true} is VALID [2022-04-08 03:35:03,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {2741#true} assume true; {2741#true} is VALID [2022-04-08 03:35:03,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {2741#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2741#true} is VALID [2022-04-08 03:35:03,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {2741#true} call ULTIMATE.init(); {2741#true} is VALID [2022-04-08 03:35:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-08 03:35:03,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83307926] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:03,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:03,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-04-08 03:35:03,729 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:03,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1794572718] [2022-04-08 03:35:03,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1794572718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:03,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:03,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:35:03,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30603538] [2022-04-08 03:35:03,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:03,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 03:35:03,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:03,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:03,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:03,751 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:35:03,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:03,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:35:03,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-08 03:35:03,752 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:03,985 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-08 03:35:03,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:35:03,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 03:35:03,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-08 03:35:03,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-08 03:35:03,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-04-08 03:35:04,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:04,038 INFO L225 Difference]: With dead ends: 69 [2022-04-08 03:35:04,038 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 03:35:04,039 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-04-08 03:35:04,039 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-08 03:35:04,039 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 43 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:04,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 03:35:04,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-04-08 03:35:04,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:04,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:04,092 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:04,092 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:04,093 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 03:35:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 03:35:04,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:04,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:04,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 45 states. [2022-04-08 03:35:04,094 INFO L87 Difference]: Start difference. First operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 45 states. [2022-04-08 03:35:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:04,094 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 03:35:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 03:35:04,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:04,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:04,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:04,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:04,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-04-08 03:35:04,096 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 35 [2022-04-08 03:35:04,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:04,096 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-04-08 03:35:04,096 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:04,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 49 transitions. [2022-04-08 03:35:04,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-08 03:35:04,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 03:35:04,149 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:04,149 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:04,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:04,368 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:04,368 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:04,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:04,368 INFO L85 PathProgramCache]: Analyzing trace with hash 385921679, now seen corresponding path program 5 times [2022-04-08 03:35:04,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:04,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [642751220] [2022-04-08 03:35:04,372 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:04,372 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:04,372 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:04,372 INFO L85 PathProgramCache]: Analyzing trace with hash 385921679, now seen corresponding path program 6 times [2022-04-08 03:35:04,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:04,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376614321] [2022-04-08 03:35:04,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:04,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:04,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:04,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {3298#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3288#true} is VALID [2022-04-08 03:35:04,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {3288#true} assume true; {3288#true} is VALID [2022-04-08 03:35:04,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3288#true} {3288#true} #107#return; {3288#true} is VALID [2022-04-08 03:35:04,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {3288#true} call ULTIMATE.init(); {3298#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:04,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {3298#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3288#true} is VALID [2022-04-08 03:35:04,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {3288#true} assume true; {3288#true} is VALID [2022-04-08 03:35:04,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3288#true} {3288#true} #107#return; {3288#true} is VALID [2022-04-08 03:35:04,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {3288#true} call #t~ret22 := main(); {3288#true} is VALID [2022-04-08 03:35:04,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {3288#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:04,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {3293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {3293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:04,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {3293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:04,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {3293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3294#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:04,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {3294#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0); {3294#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:04,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {3294#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3294#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:04,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {3294#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3295#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:04,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {3295#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~nodecount~0); {3295#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:04,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {3295#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3295#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:04,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {3295#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3296#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:35:04,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {3296#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~i~0 < ~nodecount~0); {3296#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:35:04,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {3296#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3296#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:35:04,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {3296#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3297#(and (<= main_~i~0 4) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:04,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {3297#(and (<= main_~i~0 4) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 < ~nodecount~0); {3289#false} is VALID [2022-04-08 03:35:04,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-08 03:35:04,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3289#false} is VALID [2022-04-08 03:35:04,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {3289#false} is VALID [2022-04-08 03:35:04,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {3289#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {3289#false} is VALID [2022-04-08 03:35:04,467 INFO L290 TraceCheckUtils]: 23: Hoare triple {3289#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3289#false} is VALID [2022-04-08 03:35:04,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#false} assume !(~j~0 < ~edgecount~0); {3289#false} is VALID [2022-04-08 03:35:04,467 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3289#false} is VALID [2022-04-08 03:35:04,467 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#false} assume !(~i~0 < ~nodecount~0); {3289#false} is VALID [2022-04-08 03:35:04,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-08 03:35:04,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {3289#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3289#false} is VALID [2022-04-08 03:35:04,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3289#false} is VALID [2022-04-08 03:35:04,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3289#false} is VALID [2022-04-08 03:35:04,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#false} assume !(~i~0 < ~edgecount~0); {3289#false} is VALID [2022-04-08 03:35:04,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-08 03:35:04,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {3289#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3289#false} is VALID [2022-04-08 03:35:04,467 INFO L272 TraceCheckUtils]: 34: Hoare triple {3289#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3289#false} is VALID [2022-04-08 03:35:04,467 INFO L290 TraceCheckUtils]: 35: Hoare triple {3289#false} ~cond := #in~cond; {3289#false} is VALID [2022-04-08 03:35:04,467 INFO L290 TraceCheckUtils]: 36: Hoare triple {3289#false} assume 0 == ~cond; {3289#false} is VALID [2022-04-08 03:35:04,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#false} assume !false; {3289#false} is VALID [2022-04-08 03:35:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 03:35:04,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:04,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376614321] [2022-04-08 03:35:04,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376614321] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:04,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223279100] [2022-04-08 03:35:04,468 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:35:04,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:04,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:04,469 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:04,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 03:35:04,556 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 03:35:04,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:04,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 03:35:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:04,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:04,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {3288#true} call ULTIMATE.init(); {3288#true} is VALID [2022-04-08 03:35:04,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {3288#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3288#true} is VALID [2022-04-08 03:35:04,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {3288#true} assume true; {3288#true} is VALID [2022-04-08 03:35:04,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3288#true} {3288#true} #107#return; {3288#true} is VALID [2022-04-08 03:35:04,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {3288#true} call #t~ret22 := main(); {3288#true} is VALID [2022-04-08 03:35:04,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {3288#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {3317#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {3317#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {3317#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {3317#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {3317#(<= 5 main_~nodecount~0)} ~i~0 := 0; {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:04,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:04,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:04,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:04,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:04,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:04,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3379#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:04,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {3379#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {3289#false} is VALID [2022-04-08 03:35:04,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-08 03:35:04,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {3289#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3289#false} is VALID [2022-04-08 03:35:04,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3289#false} is VALID [2022-04-08 03:35:04,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3289#false} is VALID [2022-04-08 03:35:04,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#false} assume !(~i~0 < ~edgecount~0); {3289#false} is VALID [2022-04-08 03:35:04,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-08 03:35:04,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {3289#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3289#false} is VALID [2022-04-08 03:35:04,766 INFO L272 TraceCheckUtils]: 34: Hoare triple {3289#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3289#false} is VALID [2022-04-08 03:35:04,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {3289#false} ~cond := #in~cond; {3289#false} is VALID [2022-04-08 03:35:04,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {3289#false} assume 0 == ~cond; {3289#false} is VALID [2022-04-08 03:35:04,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#false} assume !false; {3289#false} is VALID [2022-04-08 03:35:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 03:35:04,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:04,922 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#false} assume !false; {3289#false} is VALID [2022-04-08 03:35:04,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {3289#false} assume 0 == ~cond; {3289#false} is VALID [2022-04-08 03:35:04,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {3289#false} ~cond := #in~cond; {3289#false} is VALID [2022-04-08 03:35:04,923 INFO L272 TraceCheckUtils]: 34: Hoare triple {3289#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3289#false} is VALID [2022-04-08 03:35:04,923 INFO L290 TraceCheckUtils]: 33: Hoare triple {3289#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3289#false} is VALID [2022-04-08 03:35:04,923 INFO L290 TraceCheckUtils]: 32: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-08 03:35:04,923 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#false} assume !(~i~0 < ~edgecount~0); {3289#false} is VALID [2022-04-08 03:35:04,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3289#false} is VALID [2022-04-08 03:35:04,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3289#false} is VALID [2022-04-08 03:35:04,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {3289#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3289#false} is VALID [2022-04-08 03:35:04,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-08 03:35:04,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {3449#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {3289#false} is VALID [2022-04-08 03:35:04,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {3453#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3449#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {3453#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {3453#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:04,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {3453#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3453#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:04,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {3453#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {3453#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:04,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {3453#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {3453#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:04,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {3453#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3453#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:04,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {3472#(< 1 main_~nodecount~0)} ~i~0 := 0; {3453#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:04,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {3472#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {3472#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {3472#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {3472#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {3472#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {3288#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:04,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {3288#true} call #t~ret22 := main(); {3288#true} is VALID [2022-04-08 03:35:04,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3288#true} {3288#true} #107#return; {3288#true} is VALID [2022-04-08 03:35:04,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {3288#true} assume true; {3288#true} is VALID [2022-04-08 03:35:04,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {3288#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3288#true} is VALID [2022-04-08 03:35:04,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {3288#true} call ULTIMATE.init(); {3288#true} is VALID [2022-04-08 03:35:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 03:35:04,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223279100] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:04,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:04,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2022-04-08 03:35:04,933 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:04,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [642751220] [2022-04-08 03:35:04,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [642751220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:04,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:04,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:35:04,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920001636] [2022-04-08 03:35:04,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:04,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 03:35:04,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:04,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:04,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:04,959 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:35:04,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:04,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:35:04,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:35:04,960 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:05,216 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-08 03:35:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:35:05,216 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 03:35:05,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-08 03:35:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:05,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-08 03:35:05,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 77 transitions. [2022-04-08 03:35:05,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:05,262 INFO L225 Difference]: With dead ends: 72 [2022-04-08 03:35:05,262 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 03:35:05,263 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2022-04-08 03:35:05,263 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 51 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:05,263 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 43 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 03:35:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-04-08 03:35:05,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:05,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:05,297 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:05,297 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:05,298 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-08 03:35:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-04-08 03:35:05,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:05,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:05,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 48 states. [2022-04-08 03:35:05,298 INFO L87 Difference]: Start difference. First operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 48 states. [2022-04-08 03:35:05,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:05,299 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-08 03:35:05,299 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-04-08 03:35:05,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:05,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:05,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:05,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-04-08 03:35:05,300 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 38 [2022-04-08 03:35:05,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:05,300 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-04-08 03:35:05,300 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:05,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 52 transitions. [2022-04-08 03:35:05,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-04-08 03:35:05,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 03:35:05,355 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:05,355 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:05,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:05,557 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 03:35:05,557 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:05,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:05,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1361731471, now seen corresponding path program 7 times [2022-04-08 03:35:05,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:05,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [725742592] [2022-04-08 03:35:05,565 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:05,565 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:05,565 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:05,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1361731471, now seen corresponding path program 8 times [2022-04-08 03:35:05,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:05,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864600606] [2022-04-08 03:35:05,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:05,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:05,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {3882#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3874#true} is VALID [2022-04-08 03:35:05,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-04-08 03:35:05,641 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3874#true} {3874#true} #107#return; {3874#true} is VALID [2022-04-08 03:35:05,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {3874#true} call ULTIMATE.init(); {3882#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:05,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {3882#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3874#true} is VALID [2022-04-08 03:35:05,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-04-08 03:35:05,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3874#true} {3874#true} #107#return; {3874#true} is VALID [2022-04-08 03:35:05,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {3874#true} call #t~ret22 := main(); {3874#true} is VALID [2022-04-08 03:35:05,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {3874#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {3879#(<= 20 main_~edgecount~0)} ~i~0 := 0; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3880#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:05,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {3880#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {3880#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:05,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {3880#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {3880#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:05,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {3880#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3881#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:05,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {3881#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {3875#false} is VALID [2022-04-08 03:35:05,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {3875#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3875#false} is VALID [2022-04-08 03:35:05,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {3875#false} assume !(~i~0 < ~nodecount~0); {3875#false} is VALID [2022-04-08 03:35:05,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {3875#false} ~i~0 := 0; {3875#false} is VALID [2022-04-08 03:35:05,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {3875#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3875#false} is VALID [2022-04-08 03:35:05,650 INFO L290 TraceCheckUtils]: 32: Hoare triple {3875#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3875#false} is VALID [2022-04-08 03:35:05,650 INFO L290 TraceCheckUtils]: 33: Hoare triple {3875#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3875#false} is VALID [2022-04-08 03:35:05,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {3875#false} assume !(~i~0 < ~edgecount~0); {3875#false} is VALID [2022-04-08 03:35:05,650 INFO L290 TraceCheckUtils]: 35: Hoare triple {3875#false} ~i~0 := 0; {3875#false} is VALID [2022-04-08 03:35:05,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {3875#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3875#false} is VALID [2022-04-08 03:35:05,650 INFO L272 TraceCheckUtils]: 37: Hoare triple {3875#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3875#false} is VALID [2022-04-08 03:35:05,650 INFO L290 TraceCheckUtils]: 38: Hoare triple {3875#false} ~cond := #in~cond; {3875#false} is VALID [2022-04-08 03:35:05,650 INFO L290 TraceCheckUtils]: 39: Hoare triple {3875#false} assume 0 == ~cond; {3875#false} is VALID [2022-04-08 03:35:05,650 INFO L290 TraceCheckUtils]: 40: Hoare triple {3875#false} assume !false; {3875#false} is VALID [2022-04-08 03:35:05,650 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:05,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:05,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864600606] [2022-04-08 03:35:05,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864600606] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:05,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738387517] [2022-04-08 03:35:05,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:05,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:05,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:05,652 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:05,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 03:35:05,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:05,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:05,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 03:35:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:05,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:05,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {3874#true} call ULTIMATE.init(); {3874#true} is VALID [2022-04-08 03:35:05,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {3874#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3874#true} is VALID [2022-04-08 03:35:05,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-04-08 03:35:05,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3874#true} {3874#true} #107#return; {3874#true} is VALID [2022-04-08 03:35:05,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {3874#true} call #t~ret22 := main(); {3874#true} is VALID [2022-04-08 03:35:05,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {3874#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {3879#(<= 20 main_~edgecount~0)} ~i~0 := 0; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:05,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {3879#(<= 20 main_~edgecount~0)} ~i~0 := 0; {3976#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:05,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {3976#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3976#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:05,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {3976#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3976#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:05,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {3976#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3986#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:05,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {3986#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {3875#false} is VALID [2022-04-08 03:35:05,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {3875#false} ~i~0 := 0; {3875#false} is VALID [2022-04-08 03:35:05,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {3875#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3875#false} is VALID [2022-04-08 03:35:05,906 INFO L272 TraceCheckUtils]: 37: Hoare triple {3875#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3875#false} is VALID [2022-04-08 03:35:05,906 INFO L290 TraceCheckUtils]: 38: Hoare triple {3875#false} ~cond := #in~cond; {3875#false} is VALID [2022-04-08 03:35:05,906 INFO L290 TraceCheckUtils]: 39: Hoare triple {3875#false} assume 0 == ~cond; {3875#false} is VALID [2022-04-08 03:35:05,906 INFO L290 TraceCheckUtils]: 40: Hoare triple {3875#false} assume !false; {3875#false} is VALID [2022-04-08 03:35:05,906 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-08 03:35:05,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:06,082 INFO L290 TraceCheckUtils]: 40: Hoare triple {3875#false} assume !false; {3875#false} is VALID [2022-04-08 03:35:06,082 INFO L290 TraceCheckUtils]: 39: Hoare triple {3875#false} assume 0 == ~cond; {3875#false} is VALID [2022-04-08 03:35:06,083 INFO L290 TraceCheckUtils]: 38: Hoare triple {3875#false} ~cond := #in~cond; {3875#false} is VALID [2022-04-08 03:35:06,083 INFO L272 TraceCheckUtils]: 37: Hoare triple {3875#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3875#false} is VALID [2022-04-08 03:35:06,083 INFO L290 TraceCheckUtils]: 36: Hoare triple {3875#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3875#false} is VALID [2022-04-08 03:35:06,083 INFO L290 TraceCheckUtils]: 35: Hoare triple {3875#false} ~i~0 := 0; {3875#false} is VALID [2022-04-08 03:35:06,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {4026#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {3875#false} is VALID [2022-04-08 03:35:06,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {4030#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4026#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {4030#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4030#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:06,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {4030#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {4030#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:06,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {4040#(< 1 main_~edgecount~0)} ~i~0 := 0; {4030#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:06,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {4040#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {4040#(< 1 main_~edgecount~0)} ~i~0 := 0; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {4040#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {3874#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {3874#true} call #t~ret22 := main(); {3874#true} is VALID [2022-04-08 03:35:06,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3874#true} {3874#true} #107#return; {3874#true} is VALID [2022-04-08 03:35:06,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-04-08 03:35:06,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {3874#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3874#true} is VALID [2022-04-08 03:35:06,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {3874#true} call ULTIMATE.init(); {3874#true} is VALID [2022-04-08 03:35:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-08 03:35:06,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738387517] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:06,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:06,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-04-08 03:35:06,136 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:06,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [725742592] [2022-04-08 03:35:06,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [725742592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:06,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:06,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:35:06,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410970065] [2022-04-08 03:35:06,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:06,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 03:35:06,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:06,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:06,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:06,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:35:06,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:06,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:35:06,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-04-08 03:35:06,159 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:06,405 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-04-08 03:35:06,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:35:06,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 03:35:06,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-08 03:35:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-08 03:35:06,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-08 03:35:06,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:06,458 INFO L225 Difference]: With dead ends: 73 [2022-04-08 03:35:06,458 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 03:35:06,459 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:35:06,460 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 63 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:06,460 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 45 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:06,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 03:35:06,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-04-08 03:35:06,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:06,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:06,513 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:06,513 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:06,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:06,514 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-08 03:35:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 03:35:06,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:06,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:06,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 51 states. [2022-04-08 03:35:06,515 INFO L87 Difference]: Start difference. First operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 51 states. [2022-04-08 03:35:06,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:06,516 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-08 03:35:06,516 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 03:35:06,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:06,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:06,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:06,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-04-08 03:35:06,517 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 41 [2022-04-08 03:35:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:06,517 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-04-08 03:35:06,517 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:06,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 56 transitions. [2022-04-08 03:35:06,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:06,586 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-04-08 03:35:06,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 03:35:06,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:06,586 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:06,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:06,786 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:06,787 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:06,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:06,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1307195270, now seen corresponding path program 9 times [2022-04-08 03:35:06,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:06,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1622297794] [2022-04-08 03:35:06,794 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:06,794 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:06,794 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:06,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1307195270, now seen corresponding path program 10 times [2022-04-08 03:35:06,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:06,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813997638] [2022-04-08 03:35:06,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:06,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:06,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:06,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {4494#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {4485#true} is VALID [2022-04-08 03:35:06,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-08 03:35:06,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4485#true} {4485#true} #107#return; {4485#true} is VALID [2022-04-08 03:35:06,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {4485#true} call ULTIMATE.init(); {4494#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:06,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {4494#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {4485#true} is VALID [2022-04-08 03:35:06,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-08 03:35:06,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4485#true} {4485#true} #107#return; {4485#true} is VALID [2022-04-08 03:35:06,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {4485#true} call #t~ret22 := main(); {4485#true} is VALID [2022-04-08 03:35:06,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {4485#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {4490#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {4490#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {4490#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {4490#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {4490#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {4490#(<= 20 main_~edgecount~0)} ~i~0 := 0; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:06,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4491#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:06,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {4491#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4491#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:06,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {4491#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4491#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:06,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {4491#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4492#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:06,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {4492#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4492#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:06,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {4492#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4492#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:06,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {4492#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4493#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:06,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {4493#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {4486#false} is VALID [2022-04-08 03:35:06,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {4486#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4486#false} is VALID [2022-04-08 03:35:06,890 INFO L290 TraceCheckUtils]: 32: Hoare triple {4486#false} assume !(~i~0 < ~nodecount~0); {4486#false} is VALID [2022-04-08 03:35:06,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {4486#false} ~i~0 := 0; {4486#false} is VALID [2022-04-08 03:35:06,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {4486#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {4486#false} is VALID [2022-04-08 03:35:06,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {4486#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4486#false} is VALID [2022-04-08 03:35:06,890 INFO L290 TraceCheckUtils]: 36: Hoare triple {4486#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4486#false} is VALID [2022-04-08 03:35:06,890 INFO L290 TraceCheckUtils]: 37: Hoare triple {4486#false} assume !(~i~0 < ~edgecount~0); {4486#false} is VALID [2022-04-08 03:35:06,890 INFO L290 TraceCheckUtils]: 38: Hoare triple {4486#false} ~i~0 := 0; {4486#false} is VALID [2022-04-08 03:35:06,890 INFO L290 TraceCheckUtils]: 39: Hoare triple {4486#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4486#false} is VALID [2022-04-08 03:35:06,890 INFO L272 TraceCheckUtils]: 40: Hoare triple {4486#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {4486#false} is VALID [2022-04-08 03:35:06,891 INFO L290 TraceCheckUtils]: 41: Hoare triple {4486#false} ~cond := #in~cond; {4486#false} is VALID [2022-04-08 03:35:06,891 INFO L290 TraceCheckUtils]: 42: Hoare triple {4486#false} assume 0 == ~cond; {4486#false} is VALID [2022-04-08 03:35:06,891 INFO L290 TraceCheckUtils]: 43: Hoare triple {4486#false} assume !false; {4486#false} is VALID [2022-04-08 03:35:06,891 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:06,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:06,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813997638] [2022-04-08 03:35:06,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813997638] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:06,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119598986] [2022-04-08 03:35:06,891 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:35:06,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:06,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:06,892 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:06,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 03:35:06,994 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:35:06,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:06,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 03:35:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:07,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:07,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {4485#true} call ULTIMATE.init(); {4485#true} is VALID [2022-04-08 03:35:07,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {4485#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {4485#true} is VALID [2022-04-08 03:35:07,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-08 03:35:07,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4485#true} {4485#true} #107#return; {4485#true} is VALID [2022-04-08 03:35:07,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {4485#true} call #t~ret22 := main(); {4485#true} is VALID [2022-04-08 03:35:07,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {4485#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4485#true} is VALID [2022-04-08 03:35:07,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 03:35:07,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {4485#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 03:35:07,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 03:35:07,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 03:35:07,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 03:35:07,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 03:35:07,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 03:35:07,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 03:35:07,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 03:35:07,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 03:35:07,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 03:35:07,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 03:35:07,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 03:35:07,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 03:35:07,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 03:35:07,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {4485#true} assume !(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 03:35:07,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {4485#true} ~i~0 := 0; {4485#true} is VALID [2022-04-08 03:35:07,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4567#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:07,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {4567#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4567#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:07,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {4567#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4567#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:07,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {4567#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4577#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:07,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {4577#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:07,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {4581#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:07,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {4581#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:07,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {4581#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:07,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {4581#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:07,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {4581#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:07,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {4581#(< 1 main_~edgecount~0)} ~i~0 := 0; {4600#(and (<= main_~i~0 0) (< 1 main_~edgecount~0))} is VALID [2022-04-08 03:35:07,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {4600#(and (<= main_~i~0 0) (< 1 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {4600#(and (<= main_~i~0 0) (< 1 main_~edgecount~0))} is VALID [2022-04-08 03:35:07,203 INFO L290 TraceCheckUtils]: 35: Hoare triple {4600#(and (<= main_~i~0 0) (< 1 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4600#(and (<= main_~i~0 0) (< 1 main_~edgecount~0))} is VALID [2022-04-08 03:35:07,203 INFO L290 TraceCheckUtils]: 36: Hoare triple {4600#(and (<= main_~i~0 0) (< 1 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4610#(and (<= main_~i~0 1) (< 1 main_~edgecount~0))} is VALID [2022-04-08 03:35:07,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {4610#(and (<= main_~i~0 1) (< 1 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {4486#false} is VALID [2022-04-08 03:35:07,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {4486#false} ~i~0 := 0; {4486#false} is VALID [2022-04-08 03:35:07,204 INFO L290 TraceCheckUtils]: 39: Hoare triple {4486#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4486#false} is VALID [2022-04-08 03:35:07,204 INFO L272 TraceCheckUtils]: 40: Hoare triple {4486#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {4486#false} is VALID [2022-04-08 03:35:07,204 INFO L290 TraceCheckUtils]: 41: Hoare triple {4486#false} ~cond := #in~cond; {4486#false} is VALID [2022-04-08 03:35:07,204 INFO L290 TraceCheckUtils]: 42: Hoare triple {4486#false} assume 0 == ~cond; {4486#false} is VALID [2022-04-08 03:35:07,204 INFO L290 TraceCheckUtils]: 43: Hoare triple {4486#false} assume !false; {4486#false} is VALID [2022-04-08 03:35:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 03:35:07,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:07,351 INFO L290 TraceCheckUtils]: 43: Hoare triple {4486#false} assume !false; {4486#false} is VALID [2022-04-08 03:35:07,351 INFO L290 TraceCheckUtils]: 42: Hoare triple {4486#false} assume 0 == ~cond; {4486#false} is VALID [2022-04-08 03:35:07,351 INFO L290 TraceCheckUtils]: 41: Hoare triple {4486#false} ~cond := #in~cond; {4486#false} is VALID [2022-04-08 03:35:07,351 INFO L272 TraceCheckUtils]: 40: Hoare triple {4486#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {4486#false} is VALID [2022-04-08 03:35:07,351 INFO L290 TraceCheckUtils]: 39: Hoare triple {4486#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4486#false} is VALID [2022-04-08 03:35:07,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {4486#false} ~i~0 := 0; {4486#false} is VALID [2022-04-08 03:35:07,351 INFO L290 TraceCheckUtils]: 37: Hoare triple {4650#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {4486#false} is VALID [2022-04-08 03:35:07,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {4654#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4650#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:35:07,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {4654#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4654#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:07,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {4654#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {4654#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:07,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {4581#(< 1 main_~edgecount~0)} ~i~0 := 0; {4654#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:07,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {4581#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:07,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {4581#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:07,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {4581#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:07,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {4581#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:07,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {4581#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:07,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {4577#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:07,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {4567#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4577#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:07,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {4567#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4567#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:07,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {4567#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4567#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:07,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4567#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:07,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {4485#true} ~i~0 := 0; {4485#true} is VALID [2022-04-08 03:35:07,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {4485#true} assume !(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 03:35:07,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 03:35:07,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 03:35:07,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 03:35:07,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 03:35:07,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 03:35:07,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 03:35:07,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 03:35:07,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 03:35:07,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 03:35:07,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 03:35:07,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 03:35:07,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 03:35:07,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-08 03:35:07,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {4485#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-08 03:35:07,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-08 03:35:07,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {4485#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4485#true} is VALID [2022-04-08 03:35:07,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {4485#true} call #t~ret22 := main(); {4485#true} is VALID [2022-04-08 03:35:07,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4485#true} {4485#true} #107#return; {4485#true} is VALID [2022-04-08 03:35:07,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-08 03:35:07,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {4485#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {4485#true} is VALID [2022-04-08 03:35:07,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {4485#true} call ULTIMATE.init(); {4485#true} is VALID [2022-04-08 03:35:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 03:35:07,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119598986] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:07,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:07,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-04-08 03:35:07,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:07,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1622297794] [2022-04-08 03:35:07,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1622297794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:07,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:07,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:35:07,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093136396] [2022-04-08 03:35:07,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:07,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 03:35:07,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:07,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:07,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:07,389 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:35:07,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:07,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:35:07,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:35:07,391 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:07,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:07,658 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-08 03:35:07,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:35:07,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 03:35:07,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-08 03:35:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-08 03:35:07,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2022-04-08 03:35:07,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:07,717 INFO L225 Difference]: With dead ends: 79 [2022-04-08 03:35:07,717 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 03:35:07,717 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-04-08 03:35:07,717 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 74 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:07,718 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 45 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:07,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 03:35:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-04-08 03:35:07,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:07,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 52 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:07,773 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 52 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:07,774 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 52 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:07,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:07,774 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 03:35:07,775 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 03:35:07,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:07,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:07,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 54 states. [2022-04-08 03:35:07,775 INFO L87 Difference]: Start difference. First operand has 52 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 54 states. [2022-04-08 03:35:07,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:07,776 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 03:35:07,776 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 03:35:07,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:07,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:07,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:07,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:07,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:07,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-08 03:35:07,777 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 44 [2022-04-08 03:35:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:07,777 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-08 03:35:07,777 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:07,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 60 transitions. [2022-04-08 03:35:07,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-08 03:35:07,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 03:35:07,849 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:07,849 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:07,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:08,049 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:08,049 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:08,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:08,050 INFO L85 PathProgramCache]: Analyzing trace with hash -116869167, now seen corresponding path program 11 times [2022-04-08 03:35:08,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:08,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1871177900] [2022-04-08 03:35:08,054 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:08,054 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:08,054 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:08,054 INFO L85 PathProgramCache]: Analyzing trace with hash -116869167, now seen corresponding path program 12 times [2022-04-08 03:35:08,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:08,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204882063] [2022-04-08 03:35:08,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:08,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:08,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:08,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {5153#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5143#true} is VALID [2022-04-08 03:35:08,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {5143#true} assume true; {5143#true} is VALID [2022-04-08 03:35:08,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5143#true} {5143#true} #107#return; {5143#true} is VALID [2022-04-08 03:35:08,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {5143#true} call ULTIMATE.init(); {5153#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:08,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {5153#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5143#true} is VALID [2022-04-08 03:35:08,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2022-04-08 03:35:08,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #107#return; {5143#true} is VALID [2022-04-08 03:35:08,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret22 := main(); {5143#true} is VALID [2022-04-08 03:35:08,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {5143#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:08,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:08,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:08,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {5148#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:08,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:08,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:08,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {5148#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:08,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:08,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:08,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {5148#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:08,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:08,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:08,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {5148#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:08,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:08,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:08,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {5148#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:08,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:08,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {5148#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:08,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5149#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:08,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {5149#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5149#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:08,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {5149#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5149#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:08,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {5149#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5150#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:08,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {5150#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5150#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:08,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {5150#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5150#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:08,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {5150#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5151#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:08,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {5151#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5151#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:08,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {5151#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5151#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:08,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {5151#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5152#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:08,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {5152#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5144#false} is VALID [2022-04-08 03:35:08,163 INFO L290 TraceCheckUtils]: 34: Hoare triple {5144#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5144#false} is VALID [2022-04-08 03:35:08,163 INFO L290 TraceCheckUtils]: 35: Hoare triple {5144#false} assume !(~i~0 < ~nodecount~0); {5144#false} is VALID [2022-04-08 03:35:08,163 INFO L290 TraceCheckUtils]: 36: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-08 03:35:08,164 INFO L290 TraceCheckUtils]: 37: Hoare triple {5144#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5144#false} is VALID [2022-04-08 03:35:08,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {5144#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5144#false} is VALID [2022-04-08 03:35:08,164 INFO L290 TraceCheckUtils]: 39: Hoare triple {5144#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5144#false} is VALID [2022-04-08 03:35:08,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {5144#false} assume !(~i~0 < ~edgecount~0); {5144#false} is VALID [2022-04-08 03:35:08,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-08 03:35:08,164 INFO L290 TraceCheckUtils]: 42: Hoare triple {5144#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5144#false} is VALID [2022-04-08 03:35:08,164 INFO L272 TraceCheckUtils]: 43: Hoare triple {5144#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5144#false} is VALID [2022-04-08 03:35:08,164 INFO L290 TraceCheckUtils]: 44: Hoare triple {5144#false} ~cond := #in~cond; {5144#false} is VALID [2022-04-08 03:35:08,164 INFO L290 TraceCheckUtils]: 45: Hoare triple {5144#false} assume 0 == ~cond; {5144#false} is VALID [2022-04-08 03:35:08,164 INFO L290 TraceCheckUtils]: 46: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2022-04-08 03:35:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:08,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:08,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204882063] [2022-04-08 03:35:08,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204882063] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:08,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434061033] [2022-04-08 03:35:08,165 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:35:08,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:08,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:08,171 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:08,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 03:35:08,253 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 03:35:08,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:08,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 03:35:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:08,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:08,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {5143#true} call ULTIMATE.init(); {5143#true} is VALID [2022-04-08 03:35:08,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {5143#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5143#true} is VALID [2022-04-08 03:35:08,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2022-04-08 03:35:08,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #107#return; {5143#true} is VALID [2022-04-08 03:35:08,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret22 := main(); {5143#true} is VALID [2022-04-08 03:35:08,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {5143#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {5172#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {5172#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {5172#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {5172#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {5172#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {5172#(<= 5 main_~nodecount~0)} ~i~0 := 0; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:08,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:08,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:08,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:08,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:08,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:08,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:08,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:08,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:08,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:08,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:08,517 INFO L290 TraceCheckUtils]: 33: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:08,518 INFO L290 TraceCheckUtils]: 34: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5261#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:08,518 INFO L290 TraceCheckUtils]: 35: Hoare triple {5261#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {5144#false} is VALID [2022-04-08 03:35:08,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-08 03:35:08,518 INFO L290 TraceCheckUtils]: 37: Hoare triple {5144#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5144#false} is VALID [2022-04-08 03:35:08,518 INFO L290 TraceCheckUtils]: 38: Hoare triple {5144#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5144#false} is VALID [2022-04-08 03:35:08,518 INFO L290 TraceCheckUtils]: 39: Hoare triple {5144#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5144#false} is VALID [2022-04-08 03:35:08,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {5144#false} assume !(~i~0 < ~edgecount~0); {5144#false} is VALID [2022-04-08 03:35:08,518 INFO L290 TraceCheckUtils]: 41: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-08 03:35:08,518 INFO L290 TraceCheckUtils]: 42: Hoare triple {5144#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5144#false} is VALID [2022-04-08 03:35:08,519 INFO L272 TraceCheckUtils]: 43: Hoare triple {5144#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5144#false} is VALID [2022-04-08 03:35:08,519 INFO L290 TraceCheckUtils]: 44: Hoare triple {5144#false} ~cond := #in~cond; {5144#false} is VALID [2022-04-08 03:35:08,519 INFO L290 TraceCheckUtils]: 45: Hoare triple {5144#false} assume 0 == ~cond; {5144#false} is VALID [2022-04-08 03:35:08,519 INFO L290 TraceCheckUtils]: 46: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2022-04-08 03:35:08,519 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 03:35:08,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:08,686 INFO L290 TraceCheckUtils]: 46: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2022-04-08 03:35:08,686 INFO L290 TraceCheckUtils]: 45: Hoare triple {5144#false} assume 0 == ~cond; {5144#false} is VALID [2022-04-08 03:35:08,687 INFO L290 TraceCheckUtils]: 44: Hoare triple {5144#false} ~cond := #in~cond; {5144#false} is VALID [2022-04-08 03:35:08,687 INFO L272 TraceCheckUtils]: 43: Hoare triple {5144#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5144#false} is VALID [2022-04-08 03:35:08,687 INFO L290 TraceCheckUtils]: 42: Hoare triple {5144#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5144#false} is VALID [2022-04-08 03:35:08,687 INFO L290 TraceCheckUtils]: 41: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-08 03:35:08,687 INFO L290 TraceCheckUtils]: 40: Hoare triple {5144#false} assume !(~i~0 < ~edgecount~0); {5144#false} is VALID [2022-04-08 03:35:08,687 INFO L290 TraceCheckUtils]: 39: Hoare triple {5144#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5144#false} is VALID [2022-04-08 03:35:08,692 INFO L290 TraceCheckUtils]: 38: Hoare triple {5144#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5144#false} is VALID [2022-04-08 03:35:08,692 INFO L290 TraceCheckUtils]: 37: Hoare triple {5144#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5144#false} is VALID [2022-04-08 03:35:08,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-08 03:35:08,693 INFO L290 TraceCheckUtils]: 35: Hoare triple {5331#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {5144#false} is VALID [2022-04-08 03:35:08,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5331#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:08,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:08,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:08,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:08,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:08,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:08,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:08,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:08,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:08,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:08,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:08,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {5372#(< 1 main_~nodecount~0)} ~i~0 := 0; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:08,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {5372#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {5372#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {5372#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {5372#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {5372#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {5372#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {5143#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:08,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret22 := main(); {5143#true} is VALID [2022-04-08 03:35:08,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #107#return; {5143#true} is VALID [2022-04-08 03:35:08,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2022-04-08 03:35:08,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {5143#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5143#true} is VALID [2022-04-08 03:35:08,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {5143#true} call ULTIMATE.init(); {5143#true} is VALID [2022-04-08 03:35:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 03:35:08,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434061033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:08,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:08,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2022-04-08 03:35:08,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:08,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1871177900] [2022-04-08 03:35:08,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1871177900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:08,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:08,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:35:08,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210280344] [2022-04-08 03:35:08,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:08,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-08 03:35:08,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:08,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:08,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:08,741 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:35:08,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:08,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:35:08,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:35:08,741 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:09,070 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2022-04-08 03:35:09,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:35:09,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-08 03:35:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-08 03:35:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-08 03:35:09,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 77 transitions. [2022-04-08 03:35:09,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:09,134 INFO L225 Difference]: With dead ends: 85 [2022-04-08 03:35:09,134 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 03:35:09,135 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-04-08 03:35:09,135 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 82 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:09,135 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 50 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:09,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 03:35:09,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-04-08 03:35:09,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:09,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 55 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:09,195 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 55 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:09,195 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 55 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:09,200 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 03:35:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 03:35:09,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:09,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:09,201 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-04-08 03:35:09,201 INFO L87 Difference]: Start difference. First operand has 55 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-04-08 03:35:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:09,202 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 03:35:09,202 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 03:35:09,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:09,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:09,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:09,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-04-08 03:35:09,203 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 47 [2022-04-08 03:35:09,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:09,204 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-04-08 03:35:09,204 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:09,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 64 transitions. [2022-04-08 03:35:09,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-04-08 03:35:09,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 03:35:09,273 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:09,273 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:09,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:09,492 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 03:35:09,493 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:09,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:09,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1638069530, now seen corresponding path program 13 times [2022-04-08 03:35:09,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:09,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2089311311] [2022-04-08 03:35:09,496 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:09,496 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:09,496 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:09,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1638069530, now seen corresponding path program 14 times [2022-04-08 03:35:09,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:09,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351541595] [2022-04-08 03:35:09,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:09,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:09,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:09,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {5856#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5845#true} is VALID [2022-04-08 03:35:09,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-08 03:35:09,581 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5845#true} {5845#true} #107#return; {5845#true} is VALID [2022-04-08 03:35:09,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {5845#true} call ULTIMATE.init(); {5856#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:09,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {5856#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5845#true} is VALID [2022-04-08 03:35:09,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-08 03:35:09,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5845#true} {5845#true} #107#return; {5845#true} is VALID [2022-04-08 03:35:09,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {5845#true} call #t~ret22 := main(); {5845#true} is VALID [2022-04-08 03:35:09,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {5845#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {5850#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5851#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:09,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {5851#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5851#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:09,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {5851#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5851#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:09,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {5851#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5852#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:09,590 INFO L290 TraceCheckUtils]: 27: Hoare triple {5852#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5852#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:09,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {5852#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5852#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:09,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {5852#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5853#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:09,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {5853#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5853#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:09,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {5853#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5853#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:09,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {5853#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5854#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:09,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {5854#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5854#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:09,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {5854#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5854#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:09,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {5854#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5855#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:09,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {5855#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5846#false} is VALID [2022-04-08 03:35:09,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {5846#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5846#false} is VALID [2022-04-08 03:35:09,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {5846#false} assume !(~i~0 < ~nodecount~0); {5846#false} is VALID [2022-04-08 03:35:09,593 INFO L290 TraceCheckUtils]: 39: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-08 03:35:09,593 INFO L290 TraceCheckUtils]: 40: Hoare triple {5846#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5846#false} is VALID [2022-04-08 03:35:09,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {5846#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5846#false} is VALID [2022-04-08 03:35:09,593 INFO L290 TraceCheckUtils]: 42: Hoare triple {5846#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5846#false} is VALID [2022-04-08 03:35:09,593 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#false} assume !(~i~0 < ~edgecount~0); {5846#false} is VALID [2022-04-08 03:35:09,593 INFO L290 TraceCheckUtils]: 44: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-08 03:35:09,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {5846#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5846#false} is VALID [2022-04-08 03:35:09,593 INFO L272 TraceCheckUtils]: 46: Hoare triple {5846#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5846#false} is VALID [2022-04-08 03:35:09,593 INFO L290 TraceCheckUtils]: 47: Hoare triple {5846#false} ~cond := #in~cond; {5846#false} is VALID [2022-04-08 03:35:09,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {5846#false} assume 0 == ~cond; {5846#false} is VALID [2022-04-08 03:35:09,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {5846#false} assume !false; {5846#false} is VALID [2022-04-08 03:35:09,594 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:09,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:09,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351541595] [2022-04-08 03:35:09,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351541595] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:09,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046665991] [2022-04-08 03:35:09,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:09,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:09,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:09,595 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:09,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 03:35:09,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:09,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:09,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 03:35:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:09,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:09,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {5845#true} call ULTIMATE.init(); {5845#true} is VALID [2022-04-08 03:35:09,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {5845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5845#true} is VALID [2022-04-08 03:35:09,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-08 03:35:09,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5845#true} {5845#true} #107#return; {5845#true} is VALID [2022-04-08 03:35:09,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {5845#true} call #t~ret22 := main(); {5845#true} is VALID [2022-04-08 03:35:09,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {5845#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {5850#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:09,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5929#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 03:35:09,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {5929#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5929#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 03:35:09,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {5929#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5929#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 03:35:09,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {5929#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5939#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:09,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {5939#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5939#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:09,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {5939#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5939#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:09,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {5939#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5949#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:09,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {5949#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5949#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:09,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {5949#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5949#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:09,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {5949#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5959#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:09,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {5959#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5959#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:09,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {5959#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5959#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:09,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {5959#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5969#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:09,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {5969#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !(~j~0 < ~edgecount~0); {5846#false} is VALID [2022-04-08 03:35:09,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {5846#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5846#false} is VALID [2022-04-08 03:35:09,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {5846#false} assume !(~i~0 < ~nodecount~0); {5846#false} is VALID [2022-04-08 03:35:09,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-08 03:35:09,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {5846#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5846#false} is VALID [2022-04-08 03:35:09,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {5846#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5846#false} is VALID [2022-04-08 03:35:09,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {5846#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5846#false} is VALID [2022-04-08 03:35:09,951 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#false} assume !(~i~0 < ~edgecount~0); {5846#false} is VALID [2022-04-08 03:35:09,951 INFO L290 TraceCheckUtils]: 44: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-08 03:35:09,951 INFO L290 TraceCheckUtils]: 45: Hoare triple {5846#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5846#false} is VALID [2022-04-08 03:35:09,951 INFO L272 TraceCheckUtils]: 46: Hoare triple {5846#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5846#false} is VALID [2022-04-08 03:35:09,951 INFO L290 TraceCheckUtils]: 47: Hoare triple {5846#false} ~cond := #in~cond; {5846#false} is VALID [2022-04-08 03:35:09,951 INFO L290 TraceCheckUtils]: 48: Hoare triple {5846#false} assume 0 == ~cond; {5846#false} is VALID [2022-04-08 03:35:09,951 INFO L290 TraceCheckUtils]: 49: Hoare triple {5846#false} assume !false; {5846#false} is VALID [2022-04-08 03:35:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:09,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:10,144 INFO L290 TraceCheckUtils]: 49: Hoare triple {5846#false} assume !false; {5846#false} is VALID [2022-04-08 03:35:10,144 INFO L290 TraceCheckUtils]: 48: Hoare triple {5846#false} assume 0 == ~cond; {5846#false} is VALID [2022-04-08 03:35:10,144 INFO L290 TraceCheckUtils]: 47: Hoare triple {5846#false} ~cond := #in~cond; {5846#false} is VALID [2022-04-08 03:35:10,144 INFO L272 TraceCheckUtils]: 46: Hoare triple {5846#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5846#false} is VALID [2022-04-08 03:35:10,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {5846#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5846#false} is VALID [2022-04-08 03:35:10,144 INFO L290 TraceCheckUtils]: 44: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-08 03:35:10,144 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#false} assume !(~i~0 < ~edgecount~0); {5846#false} is VALID [2022-04-08 03:35:10,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {5846#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5846#false} is VALID [2022-04-08 03:35:10,144 INFO L290 TraceCheckUtils]: 41: Hoare triple {5846#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5846#false} is VALID [2022-04-08 03:35:10,144 INFO L290 TraceCheckUtils]: 40: Hoare triple {5846#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5846#false} is VALID [2022-04-08 03:35:10,144 INFO L290 TraceCheckUtils]: 39: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-08 03:35:10,144 INFO L290 TraceCheckUtils]: 38: Hoare triple {5846#false} assume !(~i~0 < ~nodecount~0); {5846#false} is VALID [2022-04-08 03:35:10,144 INFO L290 TraceCheckUtils]: 37: Hoare triple {5846#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5846#false} is VALID [2022-04-08 03:35:10,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {6051#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5846#false} is VALID [2022-04-08 03:35:10,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {6055#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6051#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {6055#(< (+ main_~j~0 1) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6055#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,148 INFO L290 TraceCheckUtils]: 33: Hoare triple {6055#(< (+ main_~j~0 1) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6055#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,148 INFO L290 TraceCheckUtils]: 32: Hoare triple {6065#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6055#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {6065#(< (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6065#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {6065#(< (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6065#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {6075#(< (+ main_~j~0 3) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6065#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {6075#(< (+ main_~j~0 3) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6075#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {6075#(< (+ main_~j~0 3) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6075#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {6085#(< (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6075#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {6085#(< (+ main_~j~0 4) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6085#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {6085#(< (+ main_~j~0 4) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6085#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6085#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {6095#(< 4 main_~edgecount~0)} ~i~0 := 0; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {6095#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {6095#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {6095#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {6095#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {6095#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {6095#(< 4 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {5845#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {5845#true} call #t~ret22 := main(); {5845#true} is VALID [2022-04-08 03:35:10,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5845#true} {5845#true} #107#return; {5845#true} is VALID [2022-04-08 03:35:10,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-08 03:35:10,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {5845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5845#true} is VALID [2022-04-08 03:35:10,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {5845#true} call ULTIMATE.init(); {5845#true} is VALID [2022-04-08 03:35:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:10,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046665991] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:10,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:10,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-04-08 03:35:10,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:10,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2089311311] [2022-04-08 03:35:10,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2089311311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:10,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:10,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 03:35:10,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349058051] [2022-04-08 03:35:10,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:10,160 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 03:35:10,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:10,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:10,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:10,185 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 03:35:10,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:10,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 03:35:10,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-08 03:35:10,185 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:10,446 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2022-04-08 03:35:10,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:35:10,446 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 03:35:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:10,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2022-04-08 03:35:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2022-04-08 03:35:10,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 81 transitions. [2022-04-08 03:35:10,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:10,511 INFO L225 Difference]: With dead ends: 91 [2022-04-08 03:35:10,511 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 03:35:10,511 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=239, Invalid=411, Unknown=0, NotChecked=0, Total=650 [2022-04-08 03:35:10,512 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 97 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:10,512 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 40 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 03:35:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2022-04-08 03:35:10,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:10,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:10,568 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:10,568 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:10,569 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 03:35:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 03:35:10,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:10,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:10,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 60 states. [2022-04-08 03:35:10,569 INFO L87 Difference]: Start difference. First operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 60 states. [2022-04-08 03:35:10,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:10,570 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 03:35:10,570 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 03:35:10,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:10,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:10,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:10,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:10,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2022-04-08 03:35:10,571 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 50 [2022-04-08 03:35:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:10,571 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2022-04-08 03:35:10,572 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:10,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 68 transitions. [2022-04-08 03:35:10,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:10,647 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2022-04-08 03:35:10,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-08 03:35:10,656 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:10,657 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:10,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:10,859 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 03:35:10,860 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:10,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:10,860 INFO L85 PathProgramCache]: Analyzing trace with hash 379897649, now seen corresponding path program 15 times [2022-04-08 03:35:10,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:10,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [990566282] [2022-04-08 03:35:10,863 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:10,863 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:10,863 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:10,863 INFO L85 PathProgramCache]: Analyzing trace with hash 379897649, now seen corresponding path program 16 times [2022-04-08 03:35:10,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:10,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819120850] [2022-04-08 03:35:10,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:10,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:10,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:10,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {6609#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {6597#true} is VALID [2022-04-08 03:35:10,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {6597#true} assume true; {6597#true} is VALID [2022-04-08 03:35:10,955 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6597#true} {6597#true} #107#return; {6597#true} is VALID [2022-04-08 03:35:10,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {6597#true} call ULTIMATE.init(); {6609#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:10,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {6609#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {6597#true} is VALID [2022-04-08 03:35:10,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {6597#true} assume true; {6597#true} is VALID [2022-04-08 03:35:10,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6597#true} {6597#true} #107#return; {6597#true} is VALID [2022-04-08 03:35:10,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {6597#true} call #t~ret22 := main(); {6597#true} is VALID [2022-04-08 03:35:10,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {6597#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {6602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {6602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {6602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {6602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {6602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {6602#(<= 20 main_~edgecount~0)} ~i~0 := 0; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:10,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6603#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:10,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {6603#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6603#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:10,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {6603#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6603#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:10,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {6603#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6604#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {6604#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6604#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {6604#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6604#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {6604#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6605#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {6605#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6605#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {6605#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6605#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,964 INFO L290 TraceCheckUtils]: 32: Hoare triple {6605#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6606#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,964 INFO L290 TraceCheckUtils]: 33: Hoare triple {6606#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6606#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {6606#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6606#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {6606#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6607#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {6607#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6607#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,966 INFO L290 TraceCheckUtils]: 37: Hoare triple {6607#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6607#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,966 INFO L290 TraceCheckUtils]: 38: Hoare triple {6607#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6608#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:10,966 INFO L290 TraceCheckUtils]: 39: Hoare triple {6608#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6598#false} is VALID [2022-04-08 03:35:10,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {6598#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6598#false} is VALID [2022-04-08 03:35:10,966 INFO L290 TraceCheckUtils]: 41: Hoare triple {6598#false} assume !(~i~0 < ~nodecount~0); {6598#false} is VALID [2022-04-08 03:35:10,967 INFO L290 TraceCheckUtils]: 42: Hoare triple {6598#false} ~i~0 := 0; {6598#false} is VALID [2022-04-08 03:35:10,967 INFO L290 TraceCheckUtils]: 43: Hoare triple {6598#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6598#false} is VALID [2022-04-08 03:35:10,967 INFO L290 TraceCheckUtils]: 44: Hoare triple {6598#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {6598#false} is VALID [2022-04-08 03:35:10,967 INFO L290 TraceCheckUtils]: 45: Hoare triple {6598#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6598#false} is VALID [2022-04-08 03:35:10,967 INFO L290 TraceCheckUtils]: 46: Hoare triple {6598#false} assume !(~i~0 < ~edgecount~0); {6598#false} is VALID [2022-04-08 03:35:10,967 INFO L290 TraceCheckUtils]: 47: Hoare triple {6598#false} ~i~0 := 0; {6598#false} is VALID [2022-04-08 03:35:10,967 INFO L290 TraceCheckUtils]: 48: Hoare triple {6598#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6598#false} is VALID [2022-04-08 03:35:10,967 INFO L272 TraceCheckUtils]: 49: Hoare triple {6598#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {6598#false} is VALID [2022-04-08 03:35:10,967 INFO L290 TraceCheckUtils]: 50: Hoare triple {6598#false} ~cond := #in~cond; {6598#false} is VALID [2022-04-08 03:35:10,967 INFO L290 TraceCheckUtils]: 51: Hoare triple {6598#false} assume 0 == ~cond; {6598#false} is VALID [2022-04-08 03:35:10,967 INFO L290 TraceCheckUtils]: 52: Hoare triple {6598#false} assume !false; {6598#false} is VALID [2022-04-08 03:35:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:10,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:10,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819120850] [2022-04-08 03:35:10,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819120850] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:10,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497496462] [2022-04-08 03:35:10,968 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:35:10,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:10,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:10,969 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:10,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 03:35:11,051 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:35:11,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:11,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 03:35:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:11,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:11,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {6597#true} call ULTIMATE.init(); {6597#true} is VALID [2022-04-08 03:35:11,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {6597#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {6597#true} is VALID [2022-04-08 03:35:11,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {6597#true} assume true; {6597#true} is VALID [2022-04-08 03:35:11,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6597#true} {6597#true} #107#return; {6597#true} is VALID [2022-04-08 03:35:11,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {6597#true} call #t~ret22 := main(); {6597#true} is VALID [2022-04-08 03:35:11,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {6597#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6597#true} is VALID [2022-04-08 03:35:11,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 03:35:11,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {6597#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 03:35:11,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 03:35:11,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 03:35:11,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 03:35:11,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 03:35:11,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 03:35:11,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 03:35:11,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 03:35:11,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 03:35:11,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 03:35:11,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 03:35:11,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 03:35:11,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 03:35:11,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 03:35:11,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {6597#true} assume !(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 03:35:11,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {6597#true} ~i~0 := 0; {6597#true} is VALID [2022-04-08 03:35:11,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6682#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:11,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {6682#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6682#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:11,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {6682#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6682#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:11,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {6682#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6692#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:11,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {6692#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6692#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:11,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {6692#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6692#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:11,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {6692#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6702#(<= 2 main_~j~0)} is VALID [2022-04-08 03:35:11,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {6702#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6702#(<= 2 main_~j~0)} is VALID [2022-04-08 03:35:11,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {6702#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6702#(<= 2 main_~j~0)} is VALID [2022-04-08 03:35:11,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {6702#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6712#(<= 3 main_~j~0)} is VALID [2022-04-08 03:35:11,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {6712#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6712#(<= 3 main_~j~0)} is VALID [2022-04-08 03:35:11,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {6712#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6712#(<= 3 main_~j~0)} is VALID [2022-04-08 03:35:11,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {6712#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6722#(<= 4 main_~j~0)} is VALID [2022-04-08 03:35:11,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {6722#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6726#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:11,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {6726#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6726#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:11,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {6726#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6726#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:11,258 INFO L290 TraceCheckUtils]: 39: Hoare triple {6726#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6726#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:11,258 INFO L290 TraceCheckUtils]: 40: Hoare triple {6726#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6726#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:11,258 INFO L290 TraceCheckUtils]: 41: Hoare triple {6726#(< 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {6726#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:35:11,258 INFO L290 TraceCheckUtils]: 42: Hoare triple {6726#(< 4 main_~edgecount~0)} ~i~0 := 0; {6745#(and (<= main_~i~0 0) (< 4 main_~edgecount~0))} is VALID [2022-04-08 03:35:11,259 INFO L290 TraceCheckUtils]: 43: Hoare triple {6745#(and (<= main_~i~0 0) (< 4 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6745#(and (<= main_~i~0 0) (< 4 main_~edgecount~0))} is VALID [2022-04-08 03:35:11,259 INFO L290 TraceCheckUtils]: 44: Hoare triple {6745#(and (<= main_~i~0 0) (< 4 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {6745#(and (<= main_~i~0 0) (< 4 main_~edgecount~0))} is VALID [2022-04-08 03:35:11,259 INFO L290 TraceCheckUtils]: 45: Hoare triple {6745#(and (<= main_~i~0 0) (< 4 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6755#(and (<= main_~i~0 1) (< 4 main_~edgecount~0))} is VALID [2022-04-08 03:35:11,260 INFO L290 TraceCheckUtils]: 46: Hoare triple {6755#(and (<= main_~i~0 1) (< 4 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {6598#false} is VALID [2022-04-08 03:35:11,260 INFO L290 TraceCheckUtils]: 47: Hoare triple {6598#false} ~i~0 := 0; {6598#false} is VALID [2022-04-08 03:35:11,260 INFO L290 TraceCheckUtils]: 48: Hoare triple {6598#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6598#false} is VALID [2022-04-08 03:35:11,260 INFO L272 TraceCheckUtils]: 49: Hoare triple {6598#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {6598#false} is VALID [2022-04-08 03:35:11,260 INFO L290 TraceCheckUtils]: 50: Hoare triple {6598#false} ~cond := #in~cond; {6598#false} is VALID [2022-04-08 03:35:11,260 INFO L290 TraceCheckUtils]: 51: Hoare triple {6598#false} assume 0 == ~cond; {6598#false} is VALID [2022-04-08 03:35:11,260 INFO L290 TraceCheckUtils]: 52: Hoare triple {6598#false} assume !false; {6598#false} is VALID [2022-04-08 03:35:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 03:35:11,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:11,485 INFO L290 TraceCheckUtils]: 52: Hoare triple {6598#false} assume !false; {6598#false} is VALID [2022-04-08 03:35:11,486 INFO L290 TraceCheckUtils]: 51: Hoare triple {6598#false} assume 0 == ~cond; {6598#false} is VALID [2022-04-08 03:35:11,486 INFO L290 TraceCheckUtils]: 50: Hoare triple {6598#false} ~cond := #in~cond; {6598#false} is VALID [2022-04-08 03:35:11,486 INFO L272 TraceCheckUtils]: 49: Hoare triple {6598#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {6598#false} is VALID [2022-04-08 03:35:11,486 INFO L290 TraceCheckUtils]: 48: Hoare triple {6598#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6598#false} is VALID [2022-04-08 03:35:11,486 INFO L290 TraceCheckUtils]: 47: Hoare triple {6598#false} ~i~0 := 0; {6598#false} is VALID [2022-04-08 03:35:11,486 INFO L290 TraceCheckUtils]: 46: Hoare triple {6795#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {6598#false} is VALID [2022-04-08 03:35:11,487 INFO L290 TraceCheckUtils]: 45: Hoare triple {6799#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6795#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:35:11,487 INFO L290 TraceCheckUtils]: 44: Hoare triple {6799#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {6799#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:11,487 INFO L290 TraceCheckUtils]: 43: Hoare triple {6799#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6799#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:11,488 INFO L290 TraceCheckUtils]: 42: Hoare triple {6809#(< 1 main_~edgecount~0)} ~i~0 := 0; {6799#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:11,488 INFO L290 TraceCheckUtils]: 41: Hoare triple {6809#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {6809#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:11,488 INFO L290 TraceCheckUtils]: 40: Hoare triple {6809#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6809#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:11,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {6809#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6809#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:11,489 INFO L290 TraceCheckUtils]: 38: Hoare triple {6809#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6809#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:11,489 INFO L290 TraceCheckUtils]: 37: Hoare triple {6809#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6809#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:11,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {6692#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6809#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:11,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {6682#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6692#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:11,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {6682#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6682#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:11,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {6682#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6682#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:11,491 INFO L290 TraceCheckUtils]: 32: Hoare triple {6840#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6682#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:11,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {6840#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6840#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:35:11,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {6840#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6840#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:35:11,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {6850#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6840#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:35:11,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {6850#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6850#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:35:11,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {6850#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6850#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:35:11,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {6860#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6850#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:35:11,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {6860#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6860#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:35:11,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {6860#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6860#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:35:11,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6860#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:35:11,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {6597#true} ~i~0 := 0; {6597#true} is VALID [2022-04-08 03:35:11,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {6597#true} assume !(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 03:35:11,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 03:35:11,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 03:35:11,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 03:35:11,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 03:35:11,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 03:35:11,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 03:35:11,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 03:35:11,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 03:35:11,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 03:35:11,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 03:35:11,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 03:35:11,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 03:35:11,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-08 03:35:11,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {6597#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-08 03:35:11,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-08 03:35:11,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {6597#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6597#true} is VALID [2022-04-08 03:35:11,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {6597#true} call #t~ret22 := main(); {6597#true} is VALID [2022-04-08 03:35:11,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6597#true} {6597#true} #107#return; {6597#true} is VALID [2022-04-08 03:35:11,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {6597#true} assume true; {6597#true} is VALID [2022-04-08 03:35:11,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {6597#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {6597#true} is VALID [2022-04-08 03:35:11,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {6597#true} call ULTIMATE.init(); {6597#true} is VALID [2022-04-08 03:35:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 03:35:11,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497496462] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:11,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:11,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-04-08 03:35:11,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:11,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [990566282] [2022-04-08 03:35:11,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [990566282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:11,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:11,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 03:35:11,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643734374] [2022-04-08 03:35:11,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:11,497 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-08 03:35:11,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:11,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:11,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:11,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 03:35:11,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:11,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 03:35:11,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-04-08 03:35:11,531 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:11,924 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2022-04-08 03:35:11,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 03:35:11,924 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-08 03:35:11,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-08 03:35:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-08 03:35:11,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 85 transitions. [2022-04-08 03:35:12,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:12,023 INFO L225 Difference]: With dead ends: 97 [2022-04-08 03:35:12,023 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 03:35:12,023 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=734, Unknown=0, NotChecked=0, Total=930 [2022-04-08 03:35:12,024 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 102 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:12,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 50 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:12,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 03:35:12,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-04-08 03:35:12,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:12,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 61 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:12,091 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 61 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:12,091 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 61 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:12,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:12,095 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-08 03:35:12,095 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-08 03:35:12,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:12,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:12,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 63 states. [2022-04-08 03:35:12,095 INFO L87 Difference]: Start difference. First operand has 61 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 63 states. [2022-04-08 03:35:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:12,096 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-08 03:35:12,097 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-08 03:35:12,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:12,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:12,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:12,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2022-04-08 03:35:12,098 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 53 [2022-04-08 03:35:12,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:12,098 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2022-04-08 03:35:12,098 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:12,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 72 transitions. [2022-04-08 03:35:12,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-04-08 03:35:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-08 03:35:12,176 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:12,176 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:12,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:12,376 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-08 03:35:12,377 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:12,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:12,377 INFO L85 PathProgramCache]: Analyzing trace with hash 360982970, now seen corresponding path program 17 times [2022-04-08 03:35:12,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:12,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [64506686] [2022-04-08 03:35:12,380 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:12,380 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:12,380 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:12,381 INFO L85 PathProgramCache]: Analyzing trace with hash 360982970, now seen corresponding path program 18 times [2022-04-08 03:35:12,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:12,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016524475] [2022-04-08 03:35:12,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:12,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:12,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:12,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {7410#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {7397#true} is VALID [2022-04-08 03:35:12,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-08 03:35:12,503 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7397#true} {7397#true} #107#return; {7397#true} is VALID [2022-04-08 03:35:12,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7410#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:12,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {7410#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {7397#true} is VALID [2022-04-08 03:35:12,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-08 03:35:12,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #107#return; {7397#true} is VALID [2022-04-08 03:35:12,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret22 := main(); {7397#true} is VALID [2022-04-08 03:35:12,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {7402#(<= 20 main_~edgecount~0)} ~i~0 := 0; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7403#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:12,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {7403#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7403#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:12,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {7403#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7403#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:12,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {7403#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7404#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:12,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {7404#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7404#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:12,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {7404#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7404#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:12,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {7404#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7405#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:12,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {7405#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7405#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:12,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {7405#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7405#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:12,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {7405#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7406#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:12,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {7406#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7406#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:12,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {7406#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7406#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:12,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {7406#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7407#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:12,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {7407#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7407#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:12,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {7407#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7407#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:12,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {7407#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7408#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:12,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {7408#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7408#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:12,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {7408#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7408#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:12,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {7408#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7409#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:12,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {7409#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7398#false} is VALID [2022-04-08 03:35:12,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {7398#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7398#false} is VALID [2022-04-08 03:35:12,516 INFO L290 TraceCheckUtils]: 44: Hoare triple {7398#false} assume !(~i~0 < ~nodecount~0); {7398#false} is VALID [2022-04-08 03:35:12,516 INFO L290 TraceCheckUtils]: 45: Hoare triple {7398#false} ~i~0 := 0; {7398#false} is VALID [2022-04-08 03:35:12,516 INFO L290 TraceCheckUtils]: 46: Hoare triple {7398#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {7398#false} is VALID [2022-04-08 03:35:12,516 INFO L290 TraceCheckUtils]: 47: Hoare triple {7398#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7398#false} is VALID [2022-04-08 03:35:12,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {7398#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7398#false} is VALID [2022-04-08 03:35:12,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {7398#false} assume !(~i~0 < ~edgecount~0); {7398#false} is VALID [2022-04-08 03:35:12,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {7398#false} ~i~0 := 0; {7398#false} is VALID [2022-04-08 03:35:12,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {7398#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7398#false} is VALID [2022-04-08 03:35:12,517 INFO L272 TraceCheckUtils]: 52: Hoare triple {7398#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {7398#false} is VALID [2022-04-08 03:35:12,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {7398#false} ~cond := #in~cond; {7398#false} is VALID [2022-04-08 03:35:12,517 INFO L290 TraceCheckUtils]: 54: Hoare triple {7398#false} assume 0 == ~cond; {7398#false} is VALID [2022-04-08 03:35:12,517 INFO L290 TraceCheckUtils]: 55: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-08 03:35:12,517 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:12,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:12,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016524475] [2022-04-08 03:35:12,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016524475] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:12,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683926419] [2022-04-08 03:35:12,517 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:35:12,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:12,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:12,518 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:12,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 03:35:12,623 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 03:35:12,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:12,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 03:35:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:12,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:12,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-08 03:35:12,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {7397#true} is VALID [2022-04-08 03:35:12,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-08 03:35:12,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #107#return; {7397#true} is VALID [2022-04-08 03:35:12,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret22 := main(); {7397#true} is VALID [2022-04-08 03:35:12,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {7402#(<= 20 main_~edgecount~0)} ~i~0 := 0; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,833 INFO L290 TraceCheckUtils]: 30: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,833 INFO L290 TraceCheckUtils]: 34: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,834 INFO L290 TraceCheckUtils]: 35: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,834 INFO L290 TraceCheckUtils]: 37: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,834 INFO L290 TraceCheckUtils]: 38: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,835 INFO L290 TraceCheckUtils]: 39: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,835 INFO L290 TraceCheckUtils]: 40: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,835 INFO L290 TraceCheckUtils]: 41: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,836 INFO L290 TraceCheckUtils]: 43: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,836 INFO L290 TraceCheckUtils]: 44: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:12,836 INFO L290 TraceCheckUtils]: 45: Hoare triple {7402#(<= 20 main_~edgecount~0)} ~i~0 := 0; {7549#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:12,837 INFO L290 TraceCheckUtils]: 46: Hoare triple {7549#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {7549#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:12,837 INFO L290 TraceCheckUtils]: 47: Hoare triple {7549#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7549#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:12,837 INFO L290 TraceCheckUtils]: 48: Hoare triple {7549#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7559#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:12,838 INFO L290 TraceCheckUtils]: 49: Hoare triple {7559#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {7398#false} is VALID [2022-04-08 03:35:12,838 INFO L290 TraceCheckUtils]: 50: Hoare triple {7398#false} ~i~0 := 0; {7398#false} is VALID [2022-04-08 03:35:12,838 INFO L290 TraceCheckUtils]: 51: Hoare triple {7398#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7398#false} is VALID [2022-04-08 03:35:12,838 INFO L272 TraceCheckUtils]: 52: Hoare triple {7398#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {7398#false} is VALID [2022-04-08 03:35:12,838 INFO L290 TraceCheckUtils]: 53: Hoare triple {7398#false} ~cond := #in~cond; {7398#false} is VALID [2022-04-08 03:35:12,838 INFO L290 TraceCheckUtils]: 54: Hoare triple {7398#false} assume 0 == ~cond; {7398#false} is VALID [2022-04-08 03:35:12,838 INFO L290 TraceCheckUtils]: 55: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-08 03:35:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-04-08 03:35:12,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:13,034 INFO L290 TraceCheckUtils]: 55: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-08 03:35:13,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {7398#false} assume 0 == ~cond; {7398#false} is VALID [2022-04-08 03:35:13,034 INFO L290 TraceCheckUtils]: 53: Hoare triple {7398#false} ~cond := #in~cond; {7398#false} is VALID [2022-04-08 03:35:13,034 INFO L272 TraceCheckUtils]: 52: Hoare triple {7398#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {7398#false} is VALID [2022-04-08 03:35:13,034 INFO L290 TraceCheckUtils]: 51: Hoare triple {7398#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7398#false} is VALID [2022-04-08 03:35:13,034 INFO L290 TraceCheckUtils]: 50: Hoare triple {7398#false} ~i~0 := 0; {7398#false} is VALID [2022-04-08 03:35:13,035 INFO L290 TraceCheckUtils]: 49: Hoare triple {7599#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {7398#false} is VALID [2022-04-08 03:35:13,035 INFO L290 TraceCheckUtils]: 48: Hoare triple {7603#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7599#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,035 INFO L290 TraceCheckUtils]: 47: Hoare triple {7603#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7603#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:13,035 INFO L290 TraceCheckUtils]: 46: Hoare triple {7603#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {7603#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:13,036 INFO L290 TraceCheckUtils]: 45: Hoare triple {7613#(< 1 main_~edgecount~0)} ~i~0 := 0; {7603#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:13,036 INFO L290 TraceCheckUtils]: 44: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,036 INFO L290 TraceCheckUtils]: 43: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {7613#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {7613#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,039 INFO L290 TraceCheckUtils]: 34: Hoare triple {7613#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {7613#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,040 INFO L290 TraceCheckUtils]: 30: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,040 INFO L290 TraceCheckUtils]: 29: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,040 INFO L290 TraceCheckUtils]: 28: Hoare triple {7613#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {7613#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {7613#(< 1 main_~edgecount~0)} ~i~0 := 0; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {7613#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:13,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret22 := main(); {7397#true} is VALID [2022-04-08 03:35:13,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #107#return; {7397#true} is VALID [2022-04-08 03:35:13,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-08 03:35:13,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {7397#true} is VALID [2022-04-08 03:35:13,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-08 03:35:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-04-08 03:35:13,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683926419] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:13,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:13,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2022-04-08 03:35:13,048 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:13,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [64506686] [2022-04-08 03:35:13,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [64506686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:13,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:13,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 03:35:13,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633123462] [2022-04-08 03:35:13,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:13,049 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-08 03:35:13,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:13,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:13,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:13,078 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 03:35:13,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:13,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 03:35:13,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-04-08 03:35:13,079 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:13,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:13,562 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-08 03:35:13,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 03:35:13,562 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-08 03:35:13,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:13,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2022-04-08 03:35:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2022-04-08 03:35:13,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 89 transitions. [2022-04-08 03:35:13,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:13,629 INFO L225 Difference]: With dead ends: 103 [2022-04-08 03:35:13,629 INFO L226 Difference]: Without dead ends: 66 [2022-04-08 03:35:13,630 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2022-04-08 03:35:13,630 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 110 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:13,630 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 60 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-08 03:35:13,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-08 03:35:13,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:13,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:13,691 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:13,691 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:13,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:13,692 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-08 03:35:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-08 03:35:13,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:13,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:13,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 66 states. [2022-04-08 03:35:13,692 INFO L87 Difference]: Start difference. First operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 66 states. [2022-04-08 03:35:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:13,699 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-08 03:35:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-08 03:35:13,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:13,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:13,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:13,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2022-04-08 03:35:13,701 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 56 [2022-04-08 03:35:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:13,701 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2022-04-08 03:35:13,701 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:13,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 76 transitions. [2022-04-08 03:35:13,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:13,781 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2022-04-08 03:35:13,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 03:35:13,781 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:13,781 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:13,799 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-08 03:35:13,981 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 03:35:13,982 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:13,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:13,982 INFO L85 PathProgramCache]: Analyzing trace with hash -485503343, now seen corresponding path program 19 times [2022-04-08 03:35:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:13,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1011624819] [2022-04-08 03:35:13,985 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:13,985 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:13,985 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:13,985 INFO L85 PathProgramCache]: Analyzing trace with hash -485503343, now seen corresponding path program 20 times [2022-04-08 03:35:13,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:13,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136016170] [2022-04-08 03:35:13,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:13,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:14,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:14,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {8247#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {8233#true} is VALID [2022-04-08 03:35:14,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {8233#true} assume true; {8233#true} is VALID [2022-04-08 03:35:14,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8233#true} {8233#true} #107#return; {8233#true} is VALID [2022-04-08 03:35:14,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {8233#true} call ULTIMATE.init(); {8247#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:14,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {8247#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {8233#true} is VALID [2022-04-08 03:35:14,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {8233#true} assume true; {8233#true} is VALID [2022-04-08 03:35:14,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8233#true} {8233#true} #107#return; {8233#true} is VALID [2022-04-08 03:35:14,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {8233#true} call #t~ret22 := main(); {8233#true} is VALID [2022-04-08 03:35:14,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {8233#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {8238#(<= 20 main_~edgecount~0)} ~i~0 := 0; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8239#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:14,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {8239#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8239#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:14,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {8239#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8239#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:14,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {8239#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8240#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {8240#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8240#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {8240#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8240#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {8240#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8241#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {8241#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8241#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {8241#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8241#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {8241#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8242#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {8242#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8242#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {8242#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8242#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {8242#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8243#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {8243#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8243#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,089 INFO L290 TraceCheckUtils]: 37: Hoare triple {8243#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8243#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {8243#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8244#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {8244#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8244#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,090 INFO L290 TraceCheckUtils]: 40: Hoare triple {8244#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8244#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,091 INFO L290 TraceCheckUtils]: 41: Hoare triple {8244#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8245#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,091 INFO L290 TraceCheckUtils]: 42: Hoare triple {8245#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8245#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,091 INFO L290 TraceCheckUtils]: 43: Hoare triple {8245#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8245#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,092 INFO L290 TraceCheckUtils]: 44: Hoare triple {8245#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8246#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {8246#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8234#false} is VALID [2022-04-08 03:35:14,092 INFO L290 TraceCheckUtils]: 46: Hoare triple {8234#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8234#false} is VALID [2022-04-08 03:35:14,092 INFO L290 TraceCheckUtils]: 47: Hoare triple {8234#false} assume !(~i~0 < ~nodecount~0); {8234#false} is VALID [2022-04-08 03:35:14,092 INFO L290 TraceCheckUtils]: 48: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-08 03:35:14,092 INFO L290 TraceCheckUtils]: 49: Hoare triple {8234#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {8234#false} is VALID [2022-04-08 03:35:14,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {8234#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {8234#false} is VALID [2022-04-08 03:35:14,092 INFO L290 TraceCheckUtils]: 51: Hoare triple {8234#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8234#false} is VALID [2022-04-08 03:35:14,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {8234#false} assume !(~i~0 < ~edgecount~0); {8234#false} is VALID [2022-04-08 03:35:14,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-08 03:35:14,092 INFO L290 TraceCheckUtils]: 54: Hoare triple {8234#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8234#false} is VALID [2022-04-08 03:35:14,092 INFO L272 TraceCheckUtils]: 55: Hoare triple {8234#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {8234#false} is VALID [2022-04-08 03:35:14,093 INFO L290 TraceCheckUtils]: 56: Hoare triple {8234#false} ~cond := #in~cond; {8234#false} is VALID [2022-04-08 03:35:14,093 INFO L290 TraceCheckUtils]: 57: Hoare triple {8234#false} assume 0 == ~cond; {8234#false} is VALID [2022-04-08 03:35:14,093 INFO L290 TraceCheckUtils]: 58: Hoare triple {8234#false} assume !false; {8234#false} is VALID [2022-04-08 03:35:14,093 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:14,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:14,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136016170] [2022-04-08 03:35:14,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136016170] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:14,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396853403] [2022-04-08 03:35:14,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:14,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:14,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:14,094 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:14,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 03:35:14,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:14,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:14,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 03:35:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:14,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:14,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {8233#true} call ULTIMATE.init(); {8233#true} is VALID [2022-04-08 03:35:14,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {8233#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {8233#true} is VALID [2022-04-08 03:35:14,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {8233#true} assume true; {8233#true} is VALID [2022-04-08 03:35:14,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8233#true} {8233#true} #107#return; {8233#true} is VALID [2022-04-08 03:35:14,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {8233#true} call #t~ret22 := main(); {8233#true} is VALID [2022-04-08 03:35:14,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {8233#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {8238#(<= 20 main_~edgecount~0)} ~i~0 := 0; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8320#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 03:35:14,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {8320#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8320#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 03:35:14,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {8320#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8320#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 03:35:14,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {8320#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8330#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:14,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {8330#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8330#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:14,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {8330#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8330#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:14,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {8330#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8340#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:14,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {8340#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8340#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:14,627 INFO L290 TraceCheckUtils]: 31: Hoare triple {8340#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8340#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:14,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {8340#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8350#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:14,628 INFO L290 TraceCheckUtils]: 33: Hoare triple {8350#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8350#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:14,628 INFO L290 TraceCheckUtils]: 34: Hoare triple {8350#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8350#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:14,628 INFO L290 TraceCheckUtils]: 35: Hoare triple {8350#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8360#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:14,629 INFO L290 TraceCheckUtils]: 36: Hoare triple {8360#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8360#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:14,629 INFO L290 TraceCheckUtils]: 37: Hoare triple {8360#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8360#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:14,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {8360#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8370#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:14,630 INFO L290 TraceCheckUtils]: 39: Hoare triple {8370#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8370#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:14,631 INFO L290 TraceCheckUtils]: 40: Hoare triple {8370#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8370#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:14,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {8370#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8380#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:14,632 INFO L290 TraceCheckUtils]: 42: Hoare triple {8380#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8380#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:14,632 INFO L290 TraceCheckUtils]: 43: Hoare triple {8380#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8380#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:14,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {8380#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8390#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:14,633 INFO L290 TraceCheckUtils]: 45: Hoare triple {8390#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume !(~j~0 < ~edgecount~0); {8234#false} is VALID [2022-04-08 03:35:14,633 INFO L290 TraceCheckUtils]: 46: Hoare triple {8234#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8234#false} is VALID [2022-04-08 03:35:14,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {8234#false} assume !(~i~0 < ~nodecount~0); {8234#false} is VALID [2022-04-08 03:35:14,633 INFO L290 TraceCheckUtils]: 48: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-08 03:35:14,633 INFO L290 TraceCheckUtils]: 49: Hoare triple {8234#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {8234#false} is VALID [2022-04-08 03:35:14,633 INFO L290 TraceCheckUtils]: 50: Hoare triple {8234#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {8234#false} is VALID [2022-04-08 03:35:14,633 INFO L290 TraceCheckUtils]: 51: Hoare triple {8234#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8234#false} is VALID [2022-04-08 03:35:14,633 INFO L290 TraceCheckUtils]: 52: Hoare triple {8234#false} assume !(~i~0 < ~edgecount~0); {8234#false} is VALID [2022-04-08 03:35:14,633 INFO L290 TraceCheckUtils]: 53: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-08 03:35:14,634 INFO L290 TraceCheckUtils]: 54: Hoare triple {8234#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8234#false} is VALID [2022-04-08 03:35:14,634 INFO L272 TraceCheckUtils]: 55: Hoare triple {8234#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {8234#false} is VALID [2022-04-08 03:35:14,634 INFO L290 TraceCheckUtils]: 56: Hoare triple {8234#false} ~cond := #in~cond; {8234#false} is VALID [2022-04-08 03:35:14,634 INFO L290 TraceCheckUtils]: 57: Hoare triple {8234#false} assume 0 == ~cond; {8234#false} is VALID [2022-04-08 03:35:14,634 INFO L290 TraceCheckUtils]: 58: Hoare triple {8234#false} assume !false; {8234#false} is VALID [2022-04-08 03:35:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:14,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:14,969 INFO L290 TraceCheckUtils]: 58: Hoare triple {8234#false} assume !false; {8234#false} is VALID [2022-04-08 03:35:14,969 INFO L290 TraceCheckUtils]: 57: Hoare triple {8234#false} assume 0 == ~cond; {8234#false} is VALID [2022-04-08 03:35:14,969 INFO L290 TraceCheckUtils]: 56: Hoare triple {8234#false} ~cond := #in~cond; {8234#false} is VALID [2022-04-08 03:35:14,969 INFO L272 TraceCheckUtils]: 55: Hoare triple {8234#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {8234#false} is VALID [2022-04-08 03:35:14,969 INFO L290 TraceCheckUtils]: 54: Hoare triple {8234#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8234#false} is VALID [2022-04-08 03:35:14,969 INFO L290 TraceCheckUtils]: 53: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-08 03:35:14,969 INFO L290 TraceCheckUtils]: 52: Hoare triple {8234#false} assume !(~i~0 < ~edgecount~0); {8234#false} is VALID [2022-04-08 03:35:14,969 INFO L290 TraceCheckUtils]: 51: Hoare triple {8234#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8234#false} is VALID [2022-04-08 03:35:14,969 INFO L290 TraceCheckUtils]: 50: Hoare triple {8234#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {8234#false} is VALID [2022-04-08 03:35:14,969 INFO L290 TraceCheckUtils]: 49: Hoare triple {8234#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {8234#false} is VALID [2022-04-08 03:35:14,969 INFO L290 TraceCheckUtils]: 48: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-08 03:35:14,969 INFO L290 TraceCheckUtils]: 47: Hoare triple {8234#false} assume !(~i~0 < ~nodecount~0); {8234#false} is VALID [2022-04-08 03:35:14,969 INFO L290 TraceCheckUtils]: 46: Hoare triple {8234#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8234#false} is VALID [2022-04-08 03:35:14,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {8472#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8234#false} is VALID [2022-04-08 03:35:14,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {8476#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8472#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {8476#(< (+ main_~j~0 1) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8476#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,971 INFO L290 TraceCheckUtils]: 42: Hoare triple {8476#(< (+ main_~j~0 1) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8476#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,971 INFO L290 TraceCheckUtils]: 41: Hoare triple {8486#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8476#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,971 INFO L290 TraceCheckUtils]: 40: Hoare triple {8486#(< (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8486#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {8486#(< (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8486#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {8496#(< (+ main_~j~0 3) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8486#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {8496#(< (+ main_~j~0 3) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8496#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {8496#(< (+ main_~j~0 3) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8496#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {8506#(< (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8496#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {8506#(< (+ main_~j~0 4) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8506#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {8506#(< (+ main_~j~0 4) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8506#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {8516#(< (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8506#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {8516#(< (+ 5 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8516#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {8516#(< (+ 5 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8516#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {8526#(< (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8516#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {8526#(< (+ main_~j~0 6) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8526#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {8526#(< (+ main_~j~0 6) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8526#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {8536#(< (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8526#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {8536#(< (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8536#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {8536#(< (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8536#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8536#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:14,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {8546#(< 7 main_~edgecount~0)} ~i~0 := 0; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {8546#(< 7 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {8546#(< 7 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {8546#(< 7 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {8546#(< 7 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {8546#(< 7 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {8546#(< 7 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {8233#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:14,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {8233#true} call #t~ret22 := main(); {8233#true} is VALID [2022-04-08 03:35:14,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8233#true} {8233#true} #107#return; {8233#true} is VALID [2022-04-08 03:35:14,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {8233#true} assume true; {8233#true} is VALID [2022-04-08 03:35:14,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {8233#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {8233#true} is VALID [2022-04-08 03:35:14,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {8233#true} call ULTIMATE.init(); {8233#true} is VALID [2022-04-08 03:35:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:14,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396853403] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:14,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:14,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2022-04-08 03:35:14,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:14,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1011624819] [2022-04-08 03:35:14,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1011624819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:14,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:14,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 03:35:14,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512871810] [2022-04-08 03:35:14,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:14,984 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-08 03:35:14,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:14,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:15,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:15,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 03:35:15,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:15,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 03:35:15,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=483, Unknown=0, NotChecked=0, Total=812 [2022-04-08 03:35:15,025 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:15,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:15,455 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2022-04-08 03:35:15,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 03:35:15,455 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-08 03:35:15,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:15,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2022-04-08 03:35:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2022-04-08 03:35:15,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 93 transitions. [2022-04-08 03:35:15,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:15,540 INFO L225 Difference]: With dead ends: 109 [2022-04-08 03:35:15,541 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 03:35:15,542 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=518, Invalid=888, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 03:35:15,542 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 124 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:15,543 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 50 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 03:35:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-04-08 03:35:15,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:15,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 67 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:15,618 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 67 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:15,618 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 67 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:15,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:15,620 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2022-04-08 03:35:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2022-04-08 03:35:15,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:15,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:15,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 69 states. [2022-04-08 03:35:15,621 INFO L87 Difference]: Start difference. First operand has 67 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 69 states. [2022-04-08 03:35:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:15,622 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2022-04-08 03:35:15,622 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2022-04-08 03:35:15,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:15,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:15,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:15,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:15,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2022-04-08 03:35:15,626 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 59 [2022-04-08 03:35:15,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:15,626 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2022-04-08 03:35:15,626 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:15,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 80 transitions. [2022-04-08 03:35:15,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:15,753 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-04-08 03:35:15,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 03:35:15,754 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:15,754 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:15,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-08 03:35:15,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 03:35:15,971 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:15,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1888708186, now seen corresponding path program 21 times [2022-04-08 03:35:15,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:15,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1667605907] [2022-04-08 03:35:15,974 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:15,974 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:15,974 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:15,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1888708186, now seen corresponding path program 22 times [2022-04-08 03:35:15,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:15,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157711788] [2022-04-08 03:35:15,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:15,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:16,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:16,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {9141#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {9126#true} is VALID [2022-04-08 03:35:16,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-08 03:35:16,092 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9126#true} {9126#true} #107#return; {9126#true} is VALID [2022-04-08 03:35:16,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {9126#true} call ULTIMATE.init(); {9141#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:16,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {9141#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {9126#true} is VALID [2022-04-08 03:35:16,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-08 03:35:16,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9126#true} {9126#true} #107#return; {9126#true} is VALID [2022-04-08 03:35:16,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {9126#true} call #t~ret22 := main(); {9126#true} is VALID [2022-04-08 03:35:16,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {9126#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {9131#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {9131#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {9131#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {9131#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {9131#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {9131#(<= 20 main_~edgecount~0)} ~i~0 := 0; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9132#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:16,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {9132#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9132#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:16,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {9132#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9132#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:16,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {9132#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9133#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {9133#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9133#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {9133#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9133#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {9133#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9134#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {9134#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9134#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {9134#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9134#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {9134#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9135#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {9135#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9135#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {9135#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9135#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {9135#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9136#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {9136#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9136#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {9136#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9136#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {9136#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9137#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,105 INFO L290 TraceCheckUtils]: 39: Hoare triple {9137#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9137#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {9137#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9137#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {9137#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9138#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,106 INFO L290 TraceCheckUtils]: 42: Hoare triple {9138#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9138#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,106 INFO L290 TraceCheckUtils]: 43: Hoare triple {9138#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9138#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {9138#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9139#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {9139#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9139#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,107 INFO L290 TraceCheckUtils]: 46: Hoare triple {9139#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9139#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,108 INFO L290 TraceCheckUtils]: 47: Hoare triple {9139#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9140#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {9140#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {9127#false} is VALID [2022-04-08 03:35:16,108 INFO L290 TraceCheckUtils]: 49: Hoare triple {9127#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9127#false} is VALID [2022-04-08 03:35:16,108 INFO L290 TraceCheckUtils]: 50: Hoare triple {9127#false} assume !(~i~0 < ~nodecount~0); {9127#false} is VALID [2022-04-08 03:35:16,108 INFO L290 TraceCheckUtils]: 51: Hoare triple {9127#false} ~i~0 := 0; {9127#false} is VALID [2022-04-08 03:35:16,108 INFO L290 TraceCheckUtils]: 52: Hoare triple {9127#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {9127#false} is VALID [2022-04-08 03:35:16,108 INFO L290 TraceCheckUtils]: 53: Hoare triple {9127#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {9127#false} is VALID [2022-04-08 03:35:16,108 INFO L290 TraceCheckUtils]: 54: Hoare triple {9127#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9127#false} is VALID [2022-04-08 03:35:16,108 INFO L290 TraceCheckUtils]: 55: Hoare triple {9127#false} assume !(~i~0 < ~edgecount~0); {9127#false} is VALID [2022-04-08 03:35:16,109 INFO L290 TraceCheckUtils]: 56: Hoare triple {9127#false} ~i~0 := 0; {9127#false} is VALID [2022-04-08 03:35:16,109 INFO L290 TraceCheckUtils]: 57: Hoare triple {9127#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9127#false} is VALID [2022-04-08 03:35:16,109 INFO L272 TraceCheckUtils]: 58: Hoare triple {9127#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {9127#false} is VALID [2022-04-08 03:35:16,109 INFO L290 TraceCheckUtils]: 59: Hoare triple {9127#false} ~cond := #in~cond; {9127#false} is VALID [2022-04-08 03:35:16,109 INFO L290 TraceCheckUtils]: 60: Hoare triple {9127#false} assume 0 == ~cond; {9127#false} is VALID [2022-04-08 03:35:16,109 INFO L290 TraceCheckUtils]: 61: Hoare triple {9127#false} assume !false; {9127#false} is VALID [2022-04-08 03:35:16,109 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 1 proven. 92 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:16,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:16,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157711788] [2022-04-08 03:35:16,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157711788] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:16,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649119959] [2022-04-08 03:35:16,110 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:35:16,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:16,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:16,111 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:16,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 03:35:16,211 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:35:16,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:16,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 03:35:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:16,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:16,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {9126#true} call ULTIMATE.init(); {9126#true} is VALID [2022-04-08 03:35:16,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {9126#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {9126#true} is VALID [2022-04-08 03:35:16,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-08 03:35:16,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9126#true} {9126#true} #107#return; {9126#true} is VALID [2022-04-08 03:35:16,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {9126#true} call #t~ret22 := main(); {9126#true} is VALID [2022-04-08 03:35:16,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {9126#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {9126#true} is VALID [2022-04-08 03:35:16,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 03:35:16,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {9126#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 03:35:16,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 03:35:16,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 03:35:16,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 03:35:16,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 03:35:16,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 03:35:16,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 03:35:16,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 03:35:16,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 03:35:16,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 03:35:16,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 03:35:16,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 03:35:16,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 03:35:16,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 03:35:16,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {9126#true} assume !(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 03:35:16,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {9126#true} ~i~0 := 0; {9126#true} is VALID [2022-04-08 03:35:16,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9214#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:16,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {9214#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9214#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:16,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {9214#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9214#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:16,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {9214#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9224#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:16,556 INFO L290 TraceCheckUtils]: 27: Hoare triple {9224#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9224#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:16,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {9224#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9224#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:16,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {9224#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9234#(<= 2 main_~j~0)} is VALID [2022-04-08 03:35:16,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {9234#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9234#(<= 2 main_~j~0)} is VALID [2022-04-08 03:35:16,557 INFO L290 TraceCheckUtils]: 31: Hoare triple {9234#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9234#(<= 2 main_~j~0)} is VALID [2022-04-08 03:35:16,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {9234#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9244#(<= 3 main_~j~0)} is VALID [2022-04-08 03:35:16,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {9244#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9244#(<= 3 main_~j~0)} is VALID [2022-04-08 03:35:16,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {9244#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9244#(<= 3 main_~j~0)} is VALID [2022-04-08 03:35:16,559 INFO L290 TraceCheckUtils]: 35: Hoare triple {9244#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9254#(<= 4 main_~j~0)} is VALID [2022-04-08 03:35:16,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {9254#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9254#(<= 4 main_~j~0)} is VALID [2022-04-08 03:35:16,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {9254#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9254#(<= 4 main_~j~0)} is VALID [2022-04-08 03:35:16,560 INFO L290 TraceCheckUtils]: 38: Hoare triple {9254#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9264#(<= 5 main_~j~0)} is VALID [2022-04-08 03:35:16,560 INFO L290 TraceCheckUtils]: 39: Hoare triple {9264#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9264#(<= 5 main_~j~0)} is VALID [2022-04-08 03:35:16,560 INFO L290 TraceCheckUtils]: 40: Hoare triple {9264#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9264#(<= 5 main_~j~0)} is VALID [2022-04-08 03:35:16,561 INFO L290 TraceCheckUtils]: 41: Hoare triple {9264#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9274#(<= 6 main_~j~0)} is VALID [2022-04-08 03:35:16,561 INFO L290 TraceCheckUtils]: 42: Hoare triple {9274#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9274#(<= 6 main_~j~0)} is VALID [2022-04-08 03:35:16,561 INFO L290 TraceCheckUtils]: 43: Hoare triple {9274#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9274#(<= 6 main_~j~0)} is VALID [2022-04-08 03:35:16,562 INFO L290 TraceCheckUtils]: 44: Hoare triple {9274#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9284#(<= 7 main_~j~0)} is VALID [2022-04-08 03:35:16,562 INFO L290 TraceCheckUtils]: 45: Hoare triple {9284#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9288#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,562 INFO L290 TraceCheckUtils]: 46: Hoare triple {9288#(< 7 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9288#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,563 INFO L290 TraceCheckUtils]: 47: Hoare triple {9288#(< 7 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9288#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,563 INFO L290 TraceCheckUtils]: 48: Hoare triple {9288#(< 7 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {9288#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,563 INFO L290 TraceCheckUtils]: 49: Hoare triple {9288#(< 7 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9288#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,563 INFO L290 TraceCheckUtils]: 50: Hoare triple {9288#(< 7 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {9288#(< 7 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,564 INFO L290 TraceCheckUtils]: 51: Hoare triple {9288#(< 7 main_~edgecount~0)} ~i~0 := 0; {9307#(and (< 7 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-08 03:35:16,564 INFO L290 TraceCheckUtils]: 52: Hoare triple {9307#(and (< 7 main_~edgecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {9307#(and (< 7 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-08 03:35:16,564 INFO L290 TraceCheckUtils]: 53: Hoare triple {9307#(and (< 7 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {9307#(and (< 7 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-08 03:35:16,565 INFO L290 TraceCheckUtils]: 54: Hoare triple {9307#(and (< 7 main_~edgecount~0) (<= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9317#(and (< 7 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 03:35:16,565 INFO L290 TraceCheckUtils]: 55: Hoare triple {9317#(and (< 7 main_~edgecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~edgecount~0); {9127#false} is VALID [2022-04-08 03:35:16,565 INFO L290 TraceCheckUtils]: 56: Hoare triple {9127#false} ~i~0 := 0; {9127#false} is VALID [2022-04-08 03:35:16,565 INFO L290 TraceCheckUtils]: 57: Hoare triple {9127#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9127#false} is VALID [2022-04-08 03:35:16,565 INFO L272 TraceCheckUtils]: 58: Hoare triple {9127#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {9127#false} is VALID [2022-04-08 03:35:16,565 INFO L290 TraceCheckUtils]: 59: Hoare triple {9127#false} ~cond := #in~cond; {9127#false} is VALID [2022-04-08 03:35:16,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {9127#false} assume 0 == ~cond; {9127#false} is VALID [2022-04-08 03:35:16,566 INFO L290 TraceCheckUtils]: 61: Hoare triple {9127#false} assume !false; {9127#false} is VALID [2022-04-08 03:35:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 71 proven. 23 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 03:35:16,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:16,847 INFO L290 TraceCheckUtils]: 61: Hoare triple {9127#false} assume !false; {9127#false} is VALID [2022-04-08 03:35:16,847 INFO L290 TraceCheckUtils]: 60: Hoare triple {9127#false} assume 0 == ~cond; {9127#false} is VALID [2022-04-08 03:35:16,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {9127#false} ~cond := #in~cond; {9127#false} is VALID [2022-04-08 03:35:16,847 INFO L272 TraceCheckUtils]: 58: Hoare triple {9127#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {9127#false} is VALID [2022-04-08 03:35:16,847 INFO L290 TraceCheckUtils]: 57: Hoare triple {9127#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9127#false} is VALID [2022-04-08 03:35:16,847 INFO L290 TraceCheckUtils]: 56: Hoare triple {9127#false} ~i~0 := 0; {9127#false} is VALID [2022-04-08 03:35:16,847 INFO L290 TraceCheckUtils]: 55: Hoare triple {9357#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {9127#false} is VALID [2022-04-08 03:35:16,848 INFO L290 TraceCheckUtils]: 54: Hoare triple {9361#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9357#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,848 INFO L290 TraceCheckUtils]: 53: Hoare triple {9361#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {9361#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,848 INFO L290 TraceCheckUtils]: 52: Hoare triple {9361#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {9361#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,848 INFO L290 TraceCheckUtils]: 51: Hoare triple {9371#(< 1 main_~edgecount~0)} ~i~0 := 0; {9361#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:16,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {9371#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {9371#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {9371#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9371#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {9371#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {9371#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,849 INFO L290 TraceCheckUtils]: 47: Hoare triple {9371#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9371#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {9371#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9371#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {9224#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9371#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:16,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {9214#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9224#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:16,851 INFO L290 TraceCheckUtils]: 43: Hoare triple {9214#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9214#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:16,851 INFO L290 TraceCheckUtils]: 42: Hoare triple {9214#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9214#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:16,851 INFO L290 TraceCheckUtils]: 41: Hoare triple {9402#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9214#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:16,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {9402#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9402#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:35:16,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {9402#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9402#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:35:16,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {9412#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9402#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:35:16,853 INFO L290 TraceCheckUtils]: 37: Hoare triple {9412#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9412#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:35:16,853 INFO L290 TraceCheckUtils]: 36: Hoare triple {9412#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9412#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:35:16,854 INFO L290 TraceCheckUtils]: 35: Hoare triple {9422#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9412#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:35:16,854 INFO L290 TraceCheckUtils]: 34: Hoare triple {9422#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9422#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:35:16,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {9422#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9422#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:35:16,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {9432#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9422#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:35:16,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {9432#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9432#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:35:16,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {9432#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9432#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:35:16,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {9442#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9432#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:35:16,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {9442#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9442#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:35:16,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {9442#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9442#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:35:16,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {9452#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9442#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:35:16,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {9452#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9452#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:35:16,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {9452#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9452#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:35:16,858 INFO L290 TraceCheckUtils]: 23: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9452#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:35:16,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {9126#true} ~i~0 := 0; {9126#true} is VALID [2022-04-08 03:35:16,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {9126#true} assume !(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 03:35:16,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 03:35:16,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 03:35:16,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 03:35:16,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 03:35:16,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 03:35:16,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 03:35:16,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 03:35:16,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 03:35:16,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 03:35:16,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 03:35:16,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 03:35:16,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 03:35:16,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-08 03:35:16,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {9126#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-08 03:35:16,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-08 03:35:16,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {9126#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {9126#true} is VALID [2022-04-08 03:35:16,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {9126#true} call #t~ret22 := main(); {9126#true} is VALID [2022-04-08 03:35:16,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9126#true} {9126#true} #107#return; {9126#true} is VALID [2022-04-08 03:35:16,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-08 03:35:16,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {9126#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {9126#true} is VALID [2022-04-08 03:35:16,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {9126#true} call ULTIMATE.init(); {9126#true} is VALID [2022-04-08 03:35:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 71 proven. 23 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 03:35:16,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649119959] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:16,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:16,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2022-04-08 03:35:16,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:16,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1667605907] [2022-04-08 03:35:16,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1667605907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:16,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:16,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 03:35:16,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921490147] [2022-04-08 03:35:16,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:16,860 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-08 03:35:16,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:16,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:16,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:16,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 03:35:16,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:16,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 03:35:16,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=843, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 03:35:16,898 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:17,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:17,373 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2022-04-08 03:35:17,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 03:35:17,373 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-08 03:35:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:17,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:17,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-08 03:35:17,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-08 03:35:17,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 97 transitions. [2022-04-08 03:35:17,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:17,450 INFO L225 Difference]: With dead ends: 115 [2022-04-08 03:35:17,450 INFO L226 Difference]: Without dead ends: 72 [2022-04-08 03:35:17,451 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=370, Invalid=1436, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 03:35:17,452 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 137 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:17,452 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 45 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:17,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-08 03:35:17,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-04-08 03:35:17,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:17,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 70 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:17,527 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 70 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:17,527 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 70 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:17,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:17,528 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-08 03:35:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-04-08 03:35:17,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:17,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:17,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 72 states. [2022-04-08 03:35:17,529 INFO L87 Difference]: Start difference. First operand has 70 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 72 states. [2022-04-08 03:35:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:17,530 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-08 03:35:17,530 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-04-08 03:35:17,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:17,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:17,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:17,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2022-04-08 03:35:17,531 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 62 [2022-04-08 03:35:17,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:17,531 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2022-04-08 03:35:17,531 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:17,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 84 transitions. [2022-04-08 03:35:17,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2022-04-08 03:35:17,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 03:35:17,652 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:17,652 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:17,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:17,853 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 03:35:17,853 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:17,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:17,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1792029199, now seen corresponding path program 23 times [2022-04-08 03:35:17,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:17,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1104155463] [2022-04-08 03:35:17,856 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:17,856 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:17,856 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:17,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1792029199, now seen corresponding path program 24 times [2022-04-08 03:35:17,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:17,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589097070] [2022-04-08 03:35:17,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:17,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:18,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:18,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {10083#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {10067#true} is VALID [2022-04-08 03:35:18,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {10067#true} assume true; {10067#true} is VALID [2022-04-08 03:35:18,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10067#true} {10067#true} #107#return; {10067#true} is VALID [2022-04-08 03:35:18,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {10067#true} call ULTIMATE.init(); {10083#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:18,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {10083#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {10067#true} is VALID [2022-04-08 03:35:18,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {10067#true} assume true; {10067#true} is VALID [2022-04-08 03:35:18,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10067#true} {10067#true} #107#return; {10067#true} is VALID [2022-04-08 03:35:18,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {10067#true} call #t~ret22 := main(); {10067#true} is VALID [2022-04-08 03:35:18,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {10067#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:18,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:18,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:18,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:18,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:18,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:18,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:18,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:18,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:18,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:18,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:18,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:18,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:18,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:18,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:18,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:18,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:18,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:18,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10073#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:18,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {10073#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10073#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:18,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {10073#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10073#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:18,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {10073#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10074#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:18,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {10074#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10074#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:18,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {10074#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10074#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:18,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {10074#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10075#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:18,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {10075#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10075#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:18,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {10075#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10075#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:18,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {10075#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10076#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:18,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {10076#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10076#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:18,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {10076#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10076#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:18,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {10076#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10077#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:18,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {10077#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10077#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:18,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {10077#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10077#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:18,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {10077#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10078#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:18,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {10078#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10078#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:18,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {10078#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10078#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:18,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {10078#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10079#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:18,038 INFO L290 TraceCheckUtils]: 42: Hoare triple {10079#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10079#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:18,039 INFO L290 TraceCheckUtils]: 43: Hoare triple {10079#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10079#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:18,039 INFO L290 TraceCheckUtils]: 44: Hoare triple {10079#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10080#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:18,039 INFO L290 TraceCheckUtils]: 45: Hoare triple {10080#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10080#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:18,040 INFO L290 TraceCheckUtils]: 46: Hoare triple {10080#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10080#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:18,040 INFO L290 TraceCheckUtils]: 47: Hoare triple {10080#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10081#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:18,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {10081#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10081#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:18,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {10081#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10081#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:18,041 INFO L290 TraceCheckUtils]: 50: Hoare triple {10081#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10082#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:18,042 INFO L290 TraceCheckUtils]: 51: Hoare triple {10082#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume !(~j~0 < ~edgecount~0); {10068#false} is VALID [2022-04-08 03:35:18,042 INFO L290 TraceCheckUtils]: 52: Hoare triple {10068#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10068#false} is VALID [2022-04-08 03:35:18,042 INFO L290 TraceCheckUtils]: 53: Hoare triple {10068#false} assume !(~i~0 < ~nodecount~0); {10068#false} is VALID [2022-04-08 03:35:18,042 INFO L290 TraceCheckUtils]: 54: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-08 03:35:18,042 INFO L290 TraceCheckUtils]: 55: Hoare triple {10068#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {10068#false} is VALID [2022-04-08 03:35:18,042 INFO L290 TraceCheckUtils]: 56: Hoare triple {10068#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10068#false} is VALID [2022-04-08 03:35:18,042 INFO L290 TraceCheckUtils]: 57: Hoare triple {10068#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10068#false} is VALID [2022-04-08 03:35:18,042 INFO L290 TraceCheckUtils]: 58: Hoare triple {10068#false} assume !(~i~0 < ~edgecount~0); {10068#false} is VALID [2022-04-08 03:35:18,042 INFO L290 TraceCheckUtils]: 59: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-08 03:35:18,042 INFO L290 TraceCheckUtils]: 60: Hoare triple {10068#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10068#false} is VALID [2022-04-08 03:35:18,042 INFO L272 TraceCheckUtils]: 61: Hoare triple {10068#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {10068#false} is VALID [2022-04-08 03:35:18,042 INFO L290 TraceCheckUtils]: 62: Hoare triple {10068#false} ~cond := #in~cond; {10068#false} is VALID [2022-04-08 03:35:18,042 INFO L290 TraceCheckUtils]: 63: Hoare triple {10068#false} assume 0 == ~cond; {10068#false} is VALID [2022-04-08 03:35:18,042 INFO L290 TraceCheckUtils]: 64: Hoare triple {10068#false} assume !false; {10068#false} is VALID [2022-04-08 03:35:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 1 proven. 117 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:18,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:18,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589097070] [2022-04-08 03:35:18,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589097070] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:18,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628510835] [2022-04-08 03:35:18,043 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:35:18,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:18,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:18,044 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:18,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 03:35:18,155 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 03:35:18,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:18,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 03:35:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:18,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:18,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {10067#true} call ULTIMATE.init(); {10067#true} is VALID [2022-04-08 03:35:18,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {10067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {10067#true} is VALID [2022-04-08 03:35:18,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {10067#true} assume true; {10067#true} is VALID [2022-04-08 03:35:18,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10067#true} {10067#true} #107#return; {10067#true} is VALID [2022-04-08 03:35:18,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {10067#true} call #t~ret22 := main(); {10067#true} is VALID [2022-04-08 03:35:18,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {10067#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {10102#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {10102#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {10102#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {10102#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {10102#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {10102#(<= 5 main_~nodecount~0)} ~i~0 := 0; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,495 INFO L290 TraceCheckUtils]: 37: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,496 INFO L290 TraceCheckUtils]: 38: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,496 INFO L290 TraceCheckUtils]: 39: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,497 INFO L290 TraceCheckUtils]: 40: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,497 INFO L290 TraceCheckUtils]: 41: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,498 INFO L290 TraceCheckUtils]: 42: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,499 INFO L290 TraceCheckUtils]: 45: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,499 INFO L290 TraceCheckUtils]: 46: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,501 INFO L290 TraceCheckUtils]: 49: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,501 INFO L290 TraceCheckUtils]: 50: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,501 INFO L290 TraceCheckUtils]: 51: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,502 INFO L290 TraceCheckUtils]: 52: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10245#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:18,502 INFO L290 TraceCheckUtils]: 53: Hoare triple {10245#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {10068#false} is VALID [2022-04-08 03:35:18,502 INFO L290 TraceCheckUtils]: 54: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-08 03:35:18,502 INFO L290 TraceCheckUtils]: 55: Hoare triple {10068#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {10068#false} is VALID [2022-04-08 03:35:18,503 INFO L290 TraceCheckUtils]: 56: Hoare triple {10068#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10068#false} is VALID [2022-04-08 03:35:18,503 INFO L290 TraceCheckUtils]: 57: Hoare triple {10068#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10068#false} is VALID [2022-04-08 03:35:18,503 INFO L290 TraceCheckUtils]: 58: Hoare triple {10068#false} assume !(~i~0 < ~edgecount~0); {10068#false} is VALID [2022-04-08 03:35:18,503 INFO L290 TraceCheckUtils]: 59: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-08 03:35:18,503 INFO L290 TraceCheckUtils]: 60: Hoare triple {10068#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10068#false} is VALID [2022-04-08 03:35:18,503 INFO L272 TraceCheckUtils]: 61: Hoare triple {10068#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {10068#false} is VALID [2022-04-08 03:35:18,503 INFO L290 TraceCheckUtils]: 62: Hoare triple {10068#false} ~cond := #in~cond; {10068#false} is VALID [2022-04-08 03:35:18,503 INFO L290 TraceCheckUtils]: 63: Hoare triple {10068#false} assume 0 == ~cond; {10068#false} is VALID [2022-04-08 03:35:18,503 INFO L290 TraceCheckUtils]: 64: Hoare triple {10068#false} assume !false; {10068#false} is VALID [2022-04-08 03:35:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-08 03:35:18,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:18,718 INFO L290 TraceCheckUtils]: 64: Hoare triple {10068#false} assume !false; {10068#false} is VALID [2022-04-08 03:35:18,718 INFO L290 TraceCheckUtils]: 63: Hoare triple {10068#false} assume 0 == ~cond; {10068#false} is VALID [2022-04-08 03:35:18,718 INFO L290 TraceCheckUtils]: 62: Hoare triple {10068#false} ~cond := #in~cond; {10068#false} is VALID [2022-04-08 03:35:18,718 INFO L272 TraceCheckUtils]: 61: Hoare triple {10068#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {10068#false} is VALID [2022-04-08 03:35:18,719 INFO L290 TraceCheckUtils]: 60: Hoare triple {10068#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10068#false} is VALID [2022-04-08 03:35:18,719 INFO L290 TraceCheckUtils]: 59: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-08 03:35:18,719 INFO L290 TraceCheckUtils]: 58: Hoare triple {10068#false} assume !(~i~0 < ~edgecount~0); {10068#false} is VALID [2022-04-08 03:35:18,719 INFO L290 TraceCheckUtils]: 57: Hoare triple {10068#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10068#false} is VALID [2022-04-08 03:35:18,719 INFO L290 TraceCheckUtils]: 56: Hoare triple {10068#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10068#false} is VALID [2022-04-08 03:35:18,719 INFO L290 TraceCheckUtils]: 55: Hoare triple {10068#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {10068#false} is VALID [2022-04-08 03:35:18,719 INFO L290 TraceCheckUtils]: 54: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-08 03:35:18,719 INFO L290 TraceCheckUtils]: 53: Hoare triple {10315#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {10068#false} is VALID [2022-04-08 03:35:18,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10315#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,720 INFO L290 TraceCheckUtils]: 51: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,720 INFO L290 TraceCheckUtils]: 50: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,720 INFO L290 TraceCheckUtils]: 49: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,721 INFO L290 TraceCheckUtils]: 48: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,721 INFO L290 TraceCheckUtils]: 47: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,721 INFO L290 TraceCheckUtils]: 46: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,722 INFO L290 TraceCheckUtils]: 45: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,722 INFO L290 TraceCheckUtils]: 44: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,722 INFO L290 TraceCheckUtils]: 43: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,722 INFO L290 TraceCheckUtils]: 42: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,723 INFO L290 TraceCheckUtils]: 41: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,723 INFO L290 TraceCheckUtils]: 40: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,723 INFO L290 TraceCheckUtils]: 39: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,723 INFO L290 TraceCheckUtils]: 38: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,724 INFO L290 TraceCheckUtils]: 37: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {10410#(< 1 main_~nodecount~0)} ~i~0 := 0; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:18,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {10410#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {10410#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {10410#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {10410#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {10410#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {10410#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {10067#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:18,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {10067#true} call #t~ret22 := main(); {10067#true} is VALID [2022-04-08 03:35:18,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10067#true} {10067#true} #107#return; {10067#true} is VALID [2022-04-08 03:35:18,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {10067#true} assume true; {10067#true} is VALID [2022-04-08 03:35:18,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {10067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {10067#true} is VALID [2022-04-08 03:35:18,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {10067#true} call ULTIMATE.init(); {10067#true} is VALID [2022-04-08 03:35:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-08 03:35:18,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628510835] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:18,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:18,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 20 [2022-04-08 03:35:18,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:18,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1104155463] [2022-04-08 03:35:18,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1104155463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:18,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:18,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 03:35:18,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715619250] [2022-04-08 03:35:18,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:18,747 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 03:35:18,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:18,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:18,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:18,788 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 03:35:18,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:18,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 03:35:18,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-04-08 03:35:18,789 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:19,344 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2022-04-08 03:35:19,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 03:35:19,344 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 03:35:19,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2022-04-08 03:35:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2022-04-08 03:35:19,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 101 transitions. [2022-04-08 03:35:19,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:19,430 INFO L225 Difference]: With dead ends: 121 [2022-04-08 03:35:19,430 INFO L226 Difference]: Without dead ends: 75 [2022-04-08 03:35:19,432 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2022-04-08 03:35:19,433 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:19,433 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 50 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:19,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-08 03:35:19,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2022-04-08 03:35:19,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:19,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:19,565 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:19,565 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:19,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:19,566 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-04-08 03:35:19,566 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2022-04-08 03:35:19,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:19,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:19,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 75 states. [2022-04-08 03:35:19,567 INFO L87 Difference]: Start difference. First operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 75 states. [2022-04-08 03:35:19,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:19,567 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-04-08 03:35:19,567 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2022-04-08 03:35:19,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:19,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:19,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:19,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-04-08 03:35:19,569 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 65 [2022-04-08 03:35:19,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:19,569 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-04-08 03:35:19,569 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 88 transitions. [2022-04-08 03:35:19,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:19,679 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-04-08 03:35:19,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 03:35:19,680 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:19,680 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:19,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:19,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:19,887 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:19,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:19,888 INFO L85 PathProgramCache]: Analyzing trace with hash 170568442, now seen corresponding path program 25 times [2022-04-08 03:35:19,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:19,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1180965203] [2022-04-08 03:35:19,891 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:19,891 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:19,891 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:19,891 INFO L85 PathProgramCache]: Analyzing trace with hash 170568442, now seen corresponding path program 26 times [2022-04-08 03:35:19,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:19,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868764319] [2022-04-08 03:35:19,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:19,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:20,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:20,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {11056#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {11039#true} is VALID [2022-04-08 03:35:20,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {11039#true} assume true; {11039#true} is VALID [2022-04-08 03:35:20,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11039#true} {11039#true} #107#return; {11039#true} is VALID [2022-04-08 03:35:20,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {11039#true} call ULTIMATE.init(); {11056#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:20,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {11056#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {11039#true} is VALID [2022-04-08 03:35:20,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {11039#true} assume true; {11039#true} is VALID [2022-04-08 03:35:20,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11039#true} {11039#true} #107#return; {11039#true} is VALID [2022-04-08 03:35:20,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {11039#true} call #t~ret22 := main(); {11039#true} is VALID [2022-04-08 03:35:20,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {11039#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {11044#(<= 20 main_~edgecount~0)} ~i~0 := 0; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11045#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:20,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {11045#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11045#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:20,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {11045#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11045#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:20,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {11045#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11046#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {11046#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11046#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {11046#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11046#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,064 INFO L290 TraceCheckUtils]: 29: Hoare triple {11046#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11047#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {11047#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11047#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {11047#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11047#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {11047#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11048#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,066 INFO L290 TraceCheckUtils]: 33: Hoare triple {11048#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11048#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {11048#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11048#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {11048#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11049#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,067 INFO L290 TraceCheckUtils]: 36: Hoare triple {11049#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11049#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {11049#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11049#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {11049#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11050#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,069 INFO L290 TraceCheckUtils]: 39: Hoare triple {11050#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11050#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,069 INFO L290 TraceCheckUtils]: 40: Hoare triple {11050#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11050#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,070 INFO L290 TraceCheckUtils]: 41: Hoare triple {11050#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11051#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,070 INFO L290 TraceCheckUtils]: 42: Hoare triple {11051#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11051#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,071 INFO L290 TraceCheckUtils]: 43: Hoare triple {11051#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11051#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,071 INFO L290 TraceCheckUtils]: 44: Hoare triple {11051#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11052#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,071 INFO L290 TraceCheckUtils]: 45: Hoare triple {11052#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11052#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,072 INFO L290 TraceCheckUtils]: 46: Hoare triple {11052#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11052#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,072 INFO L290 TraceCheckUtils]: 47: Hoare triple {11052#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11053#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,072 INFO L290 TraceCheckUtils]: 48: Hoare triple {11053#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11053#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,073 INFO L290 TraceCheckUtils]: 49: Hoare triple {11053#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11053#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,073 INFO L290 TraceCheckUtils]: 50: Hoare triple {11053#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,073 INFO L290 TraceCheckUtils]: 51: Hoare triple {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,074 INFO L290 TraceCheckUtils]: 52: Hoare triple {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,074 INFO L290 TraceCheckUtils]: 53: Hoare triple {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:20,075 INFO L290 TraceCheckUtils]: 54: Hoare triple {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11040#false} is VALID [2022-04-08 03:35:20,075 INFO L290 TraceCheckUtils]: 55: Hoare triple {11040#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11040#false} is VALID [2022-04-08 03:35:20,075 INFO L290 TraceCheckUtils]: 56: Hoare triple {11040#false} assume !(~i~0 < ~nodecount~0); {11040#false} is VALID [2022-04-08 03:35:20,075 INFO L290 TraceCheckUtils]: 57: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-08 03:35:20,075 INFO L290 TraceCheckUtils]: 58: Hoare triple {11040#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11040#false} is VALID [2022-04-08 03:35:20,075 INFO L290 TraceCheckUtils]: 59: Hoare triple {11040#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {11040#false} is VALID [2022-04-08 03:35:20,075 INFO L290 TraceCheckUtils]: 60: Hoare triple {11040#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11040#false} is VALID [2022-04-08 03:35:20,075 INFO L290 TraceCheckUtils]: 61: Hoare triple {11040#false} assume !(~i~0 < ~edgecount~0); {11040#false} is VALID [2022-04-08 03:35:20,075 INFO L290 TraceCheckUtils]: 62: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-08 03:35:20,075 INFO L290 TraceCheckUtils]: 63: Hoare triple {11040#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11040#false} is VALID [2022-04-08 03:35:20,075 INFO L272 TraceCheckUtils]: 64: Hoare triple {11040#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {11040#false} is VALID [2022-04-08 03:35:20,075 INFO L290 TraceCheckUtils]: 65: Hoare triple {11040#false} ~cond := #in~cond; {11040#false} is VALID [2022-04-08 03:35:20,075 INFO L290 TraceCheckUtils]: 66: Hoare triple {11040#false} assume 0 == ~cond; {11040#false} is VALID [2022-04-08 03:35:20,076 INFO L290 TraceCheckUtils]: 67: Hoare triple {11040#false} assume !false; {11040#false} is VALID [2022-04-08 03:35:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:20,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:20,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868764319] [2022-04-08 03:35:20,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868764319] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:20,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864886818] [2022-04-08 03:35:20,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:20,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:20,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:20,091 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:20,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 03:35:20,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:20,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:20,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 03:35:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:20,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:20,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {11039#true} call ULTIMATE.init(); {11039#true} is VALID [2022-04-08 03:35:20,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {11039#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {11039#true} is VALID [2022-04-08 03:35:20,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {11039#true} assume true; {11039#true} is VALID [2022-04-08 03:35:20,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11039#true} {11039#true} #107#return; {11039#true} is VALID [2022-04-08 03:35:20,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {11039#true} call #t~ret22 := main(); {11039#true} is VALID [2022-04-08 03:35:20,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {11039#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {11044#(<= 20 main_~edgecount~0)} ~i~0 := 0; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:20,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11129#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 03:35:20,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {11129#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11129#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 03:35:20,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {11129#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11129#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 03:35:20,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {11129#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:20,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {11139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:20,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {11139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:20,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {11139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11149#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:20,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {11149#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11149#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:20,768 INFO L290 TraceCheckUtils]: 31: Hoare triple {11149#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11149#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:20,768 INFO L290 TraceCheckUtils]: 32: Hoare triple {11149#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:20,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {11159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:20,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {11159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:20,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {11159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:20,770 INFO L290 TraceCheckUtils]: 36: Hoare triple {11169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:20,770 INFO L290 TraceCheckUtils]: 37: Hoare triple {11169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:20,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {11169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11179#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:20,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {11179#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11179#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:20,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {11179#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11179#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:20,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {11179#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11189#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:20,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {11189#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11189#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:20,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {11189#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11189#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:20,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {11189#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11199#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:20,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {11199#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11199#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:20,775 INFO L290 TraceCheckUtils]: 46: Hoare triple {11199#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11199#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:20,775 INFO L290 TraceCheckUtils]: 47: Hoare triple {11199#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11209#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:20,776 INFO L290 TraceCheckUtils]: 48: Hoare triple {11209#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11209#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:20,776 INFO L290 TraceCheckUtils]: 49: Hoare triple {11209#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11209#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:20,776 INFO L290 TraceCheckUtils]: 50: Hoare triple {11209#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11219#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:20,777 INFO L290 TraceCheckUtils]: 51: Hoare triple {11219#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11219#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:20,778 INFO L290 TraceCheckUtils]: 52: Hoare triple {11219#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11219#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:20,778 INFO L290 TraceCheckUtils]: 53: Hoare triple {11219#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11229#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:20,779 INFO L290 TraceCheckUtils]: 54: Hoare triple {11229#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume !(~j~0 < ~edgecount~0); {11040#false} is VALID [2022-04-08 03:35:20,779 INFO L290 TraceCheckUtils]: 55: Hoare triple {11040#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11040#false} is VALID [2022-04-08 03:35:20,779 INFO L290 TraceCheckUtils]: 56: Hoare triple {11040#false} assume !(~i~0 < ~nodecount~0); {11040#false} is VALID [2022-04-08 03:35:20,779 INFO L290 TraceCheckUtils]: 57: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-08 03:35:20,779 INFO L290 TraceCheckUtils]: 58: Hoare triple {11040#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11040#false} is VALID [2022-04-08 03:35:20,779 INFO L290 TraceCheckUtils]: 59: Hoare triple {11040#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {11040#false} is VALID [2022-04-08 03:35:20,779 INFO L290 TraceCheckUtils]: 60: Hoare triple {11040#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11040#false} is VALID [2022-04-08 03:35:20,779 INFO L290 TraceCheckUtils]: 61: Hoare triple {11040#false} assume !(~i~0 < ~edgecount~0); {11040#false} is VALID [2022-04-08 03:35:20,779 INFO L290 TraceCheckUtils]: 62: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-08 03:35:20,779 INFO L290 TraceCheckUtils]: 63: Hoare triple {11040#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11040#false} is VALID [2022-04-08 03:35:20,779 INFO L272 TraceCheckUtils]: 64: Hoare triple {11040#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {11040#false} is VALID [2022-04-08 03:35:20,780 INFO L290 TraceCheckUtils]: 65: Hoare triple {11040#false} ~cond := #in~cond; {11040#false} is VALID [2022-04-08 03:35:20,780 INFO L290 TraceCheckUtils]: 66: Hoare triple {11040#false} assume 0 == ~cond; {11040#false} is VALID [2022-04-08 03:35:20,780 INFO L290 TraceCheckUtils]: 67: Hoare triple {11040#false} assume !false; {11040#false} is VALID [2022-04-08 03:35:20,780 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:20,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:21,161 INFO L290 TraceCheckUtils]: 67: Hoare triple {11040#false} assume !false; {11040#false} is VALID [2022-04-08 03:35:21,161 INFO L290 TraceCheckUtils]: 66: Hoare triple {11040#false} assume 0 == ~cond; {11040#false} is VALID [2022-04-08 03:35:21,161 INFO L290 TraceCheckUtils]: 65: Hoare triple {11040#false} ~cond := #in~cond; {11040#false} is VALID [2022-04-08 03:35:21,161 INFO L272 TraceCheckUtils]: 64: Hoare triple {11040#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {11040#false} is VALID [2022-04-08 03:35:21,161 INFO L290 TraceCheckUtils]: 63: Hoare triple {11040#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11040#false} is VALID [2022-04-08 03:35:21,161 INFO L290 TraceCheckUtils]: 62: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-08 03:35:21,161 INFO L290 TraceCheckUtils]: 61: Hoare triple {11040#false} assume !(~i~0 < ~edgecount~0); {11040#false} is VALID [2022-04-08 03:35:21,161 INFO L290 TraceCheckUtils]: 60: Hoare triple {11040#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11040#false} is VALID [2022-04-08 03:35:21,161 INFO L290 TraceCheckUtils]: 59: Hoare triple {11040#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {11040#false} is VALID [2022-04-08 03:35:21,161 INFO L290 TraceCheckUtils]: 58: Hoare triple {11040#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11040#false} is VALID [2022-04-08 03:35:21,161 INFO L290 TraceCheckUtils]: 57: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-08 03:35:21,161 INFO L290 TraceCheckUtils]: 56: Hoare triple {11040#false} assume !(~i~0 < ~nodecount~0); {11040#false} is VALID [2022-04-08 03:35:21,162 INFO L290 TraceCheckUtils]: 55: Hoare triple {11040#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11040#false} is VALID [2022-04-08 03:35:21,167 INFO L290 TraceCheckUtils]: 54: Hoare triple {11311#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11040#false} is VALID [2022-04-08 03:35:21,167 INFO L290 TraceCheckUtils]: 53: Hoare triple {11315#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11311#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,167 INFO L290 TraceCheckUtils]: 52: Hoare triple {11315#(< (+ main_~j~0 1) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11315#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,168 INFO L290 TraceCheckUtils]: 51: Hoare triple {11315#(< (+ main_~j~0 1) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11315#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,168 INFO L290 TraceCheckUtils]: 50: Hoare triple {11325#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11315#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,168 INFO L290 TraceCheckUtils]: 49: Hoare triple {11325#(< (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11325#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,169 INFO L290 TraceCheckUtils]: 48: Hoare triple {11325#(< (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11325#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,169 INFO L290 TraceCheckUtils]: 47: Hoare triple {11335#(< (+ main_~j~0 3) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11325#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,170 INFO L290 TraceCheckUtils]: 46: Hoare triple {11335#(< (+ main_~j~0 3) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11335#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,170 INFO L290 TraceCheckUtils]: 45: Hoare triple {11335#(< (+ main_~j~0 3) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11335#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,171 INFO L290 TraceCheckUtils]: 44: Hoare triple {11345#(< (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11335#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,171 INFO L290 TraceCheckUtils]: 43: Hoare triple {11345#(< (+ main_~j~0 4) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11345#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {11345#(< (+ main_~j~0 4) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11345#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {11355#(< (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11345#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,172 INFO L290 TraceCheckUtils]: 40: Hoare triple {11355#(< (+ 5 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11355#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,172 INFO L290 TraceCheckUtils]: 39: Hoare triple {11355#(< (+ 5 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11355#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,172 INFO L290 TraceCheckUtils]: 38: Hoare triple {11365#(< (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11355#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,173 INFO L290 TraceCheckUtils]: 37: Hoare triple {11365#(< (+ main_~j~0 6) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11365#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,173 INFO L290 TraceCheckUtils]: 36: Hoare triple {11365#(< (+ main_~j~0 6) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11365#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {11375#(< (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11365#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,174 INFO L290 TraceCheckUtils]: 34: Hoare triple {11375#(< (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11375#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {11375#(< (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11375#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {11385#(< (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11375#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {11385#(< (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11385#(< (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,175 INFO L290 TraceCheckUtils]: 30: Hoare triple {11385#(< (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11385#(< (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11385#(< (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:21,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {11413#(<= 11 main_~edgecount~0)} ~i~0 := 0; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {11413#(<= 11 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {11413#(<= 11 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {11413#(<= 11 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {11413#(<= 11 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {11413#(<= 11 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {11039#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-08 03:35:21,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {11039#true} call #t~ret22 := main(); {11039#true} is VALID [2022-04-08 03:35:21,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11039#true} {11039#true} #107#return; {11039#true} is VALID [2022-04-08 03:35:21,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {11039#true} assume true; {11039#true} is VALID [2022-04-08 03:35:21,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {11039#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {11039#true} is VALID [2022-04-08 03:35:21,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {11039#true} call ULTIMATE.init(); {11039#true} is VALID [2022-04-08 03:35:21,184 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:21,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864886818] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:21,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:21,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 36 [2022-04-08 03:35:21,185 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:21,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1180965203] [2022-04-08 03:35:21,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1180965203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:21,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:21,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 03:35:21,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270893382] [2022-04-08 03:35:21,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:21,185 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-08 03:35:21,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:21,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:21,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:21,223 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 03:35:21,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:21,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 03:35:21,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=746, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 03:35:21,224 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:21,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:21,855 INFO L93 Difference]: Finished difference Result 127 states and 158 transitions. [2022-04-08 03:35:21,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 03:35:21,855 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-08 03:35:21,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:21,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 105 transitions. [2022-04-08 03:35:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 105 transitions. [2022-04-08 03:35:21,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 105 transitions. [2022-04-08 03:35:21,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:21,944 INFO L225 Difference]: With dead ends: 127 [2022-04-08 03:35:21,944 INFO L226 Difference]: Without dead ends: 78 [2022-04-08 03:35:21,945 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=816, Invalid=1440, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 03:35:21,945 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 158 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:21,945 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 55 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-08 03:35:22,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-04-08 03:35:22,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:22,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 76 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:22,069 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 76 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:22,069 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 76 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:22,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:22,084 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-04-08 03:35:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-04-08 03:35:22,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:22,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:22,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 78 states. [2022-04-08 03:35:22,084 INFO L87 Difference]: Start difference. First operand has 76 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 78 states. [2022-04-08 03:35:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:22,100 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-04-08 03:35:22,100 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-04-08 03:35:22,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:22,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:22,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:22,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:22,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:22,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2022-04-08 03:35:22,104 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 68 [2022-04-08 03:35:22,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:22,104 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2022-04-08 03:35:22,104 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:22,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 92 transitions. [2022-04-08 03:35:22,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2022-04-08 03:35:22,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 03:35:22,222 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:22,223 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:22,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:22,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:22,423 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:22,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:22,423 INFO L85 PathProgramCache]: Analyzing trace with hash 527091025, now seen corresponding path program 27 times [2022-04-08 03:35:22,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:22,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [984072477] [2022-04-08 03:35:22,427 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:22,427 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:22,427 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:22,427 INFO L85 PathProgramCache]: Analyzing trace with hash 527091025, now seen corresponding path program 28 times [2022-04-08 03:35:22,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:22,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004753720] [2022-04-08 03:35:22,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:22,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:22,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:22,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {12089#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {12071#true} is VALID [2022-04-08 03:35:22,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {12071#true} assume true; {12071#true} is VALID [2022-04-08 03:35:22,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12071#true} {12071#true} #107#return; {12071#true} is VALID [2022-04-08 03:35:22,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {12071#true} call ULTIMATE.init(); {12089#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:22,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {12089#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {12071#true} is VALID [2022-04-08 03:35:22,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {12071#true} assume true; {12071#true} is VALID [2022-04-08 03:35:22,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12071#true} {12071#true} #107#return; {12071#true} is VALID [2022-04-08 03:35:22,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {12071#true} call #t~ret22 := main(); {12071#true} is VALID [2022-04-08 03:35:22,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {12071#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:22,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:22,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:22,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {12076#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:22,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:22,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:22,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {12076#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:22,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:22,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:22,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {12076#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:22,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:22,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:22,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {12076#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:22,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:22,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:22,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {12076#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:22,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:22,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {12076#(<= 20 main_~edgecount~0)} ~i~0 := 0; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:22,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12077#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:22,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {12077#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12077#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:22,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {12077#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12077#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:22,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {12077#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12078#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {12078#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12078#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {12078#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12078#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {12078#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12079#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {12079#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12079#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {12079#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12079#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {12079#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12080#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,602 INFO L290 TraceCheckUtils]: 33: Hoare triple {12080#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12080#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {12080#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12080#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {12080#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12081#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {12081#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12081#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {12081#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12081#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,604 INFO L290 TraceCheckUtils]: 38: Hoare triple {12081#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12082#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,605 INFO L290 TraceCheckUtils]: 39: Hoare triple {12082#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12082#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {12082#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12082#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {12082#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12083#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {12083#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12083#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {12083#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12083#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,606 INFO L290 TraceCheckUtils]: 44: Hoare triple {12083#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12084#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,607 INFO L290 TraceCheckUtils]: 45: Hoare triple {12084#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12084#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,607 INFO L290 TraceCheckUtils]: 46: Hoare triple {12084#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12084#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,607 INFO L290 TraceCheckUtils]: 47: Hoare triple {12084#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12085#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,608 INFO L290 TraceCheckUtils]: 48: Hoare triple {12085#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12085#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,608 INFO L290 TraceCheckUtils]: 49: Hoare triple {12085#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12085#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,608 INFO L290 TraceCheckUtils]: 50: Hoare triple {12085#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12086#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,608 INFO L290 TraceCheckUtils]: 51: Hoare triple {12086#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12086#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,609 INFO L290 TraceCheckUtils]: 52: Hoare triple {12086#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12086#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,609 INFO L290 TraceCheckUtils]: 53: Hoare triple {12086#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12087#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,609 INFO L290 TraceCheckUtils]: 54: Hoare triple {12087#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12087#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,609 INFO L290 TraceCheckUtils]: 55: Hoare triple {12087#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12087#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,610 INFO L290 TraceCheckUtils]: 56: Hoare triple {12087#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12088#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:22,610 INFO L290 TraceCheckUtils]: 57: Hoare triple {12088#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {12072#false} is VALID [2022-04-08 03:35:22,610 INFO L290 TraceCheckUtils]: 58: Hoare triple {12072#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12072#false} is VALID [2022-04-08 03:35:22,611 INFO L290 TraceCheckUtils]: 59: Hoare triple {12072#false} assume !(~i~0 < ~nodecount~0); {12072#false} is VALID [2022-04-08 03:35:22,611 INFO L290 TraceCheckUtils]: 60: Hoare triple {12072#false} ~i~0 := 0; {12072#false} is VALID [2022-04-08 03:35:22,611 INFO L290 TraceCheckUtils]: 61: Hoare triple {12072#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {12072#false} is VALID [2022-04-08 03:35:22,611 INFO L290 TraceCheckUtils]: 62: Hoare triple {12072#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {12072#false} is VALID [2022-04-08 03:35:22,611 INFO L290 TraceCheckUtils]: 63: Hoare triple {12072#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {12072#false} is VALID [2022-04-08 03:35:22,611 INFO L290 TraceCheckUtils]: 64: Hoare triple {12072#false} assume !(~i~0 < ~edgecount~0); {12072#false} is VALID [2022-04-08 03:35:22,611 INFO L290 TraceCheckUtils]: 65: Hoare triple {12072#false} ~i~0 := 0; {12072#false} is VALID [2022-04-08 03:35:22,611 INFO L290 TraceCheckUtils]: 66: Hoare triple {12072#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12072#false} is VALID [2022-04-08 03:35:22,611 INFO L272 TraceCheckUtils]: 67: Hoare triple {12072#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {12072#false} is VALID [2022-04-08 03:35:22,611 INFO L290 TraceCheckUtils]: 68: Hoare triple {12072#false} ~cond := #in~cond; {12072#false} is VALID [2022-04-08 03:35:22,611 INFO L290 TraceCheckUtils]: 69: Hoare triple {12072#false} assume 0 == ~cond; {12072#false} is VALID [2022-04-08 03:35:22,611 INFO L290 TraceCheckUtils]: 70: Hoare triple {12072#false} assume !false; {12072#false} is VALID [2022-04-08 03:35:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 1 proven. 176 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:22,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:22,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004753720] [2022-04-08 03:35:22,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004753720] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:22,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510463318] [2022-04-08 03:35:22,612 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:35:22,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:22,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:22,613 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:22,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 03:35:22,734 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:35:22,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:22,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 03:35:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:22,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:23,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {12071#true} call ULTIMATE.init(); {12071#true} is VALID [2022-04-08 03:35:23,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {12071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {12071#true} is VALID [2022-04-08 03:35:23,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {12071#true} assume true; {12071#true} is VALID [2022-04-08 03:35:23,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12071#true} {12071#true} #107#return; {12071#true} is VALID [2022-04-08 03:35:23,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {12071#true} call #t~ret22 := main(); {12071#true} is VALID [2022-04-08 03:35:23,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {12071#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {12071#true} is VALID [2022-04-08 03:35:23,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 03:35:23,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {12071#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 03:35:23,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 03:35:23,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 03:35:23,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 03:35:23,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 03:35:23,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 03:35:23,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 03:35:23,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 03:35:23,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 03:35:23,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 03:35:23,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 03:35:23,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 03:35:23,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 03:35:23,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 03:35:23,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {12071#true} assume !(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 03:35:23,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {12071#true} ~i~0 := 0; {12071#true} is VALID [2022-04-08 03:35:23,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12162#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:23,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {12162#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12162#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:23,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {12162#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12162#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:23,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {12162#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12172#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:23,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {12172#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12172#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:23,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {12172#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12172#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:23,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {12172#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12182#(<= 2 main_~j~0)} is VALID [2022-04-08 03:35:23,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {12182#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12182#(<= 2 main_~j~0)} is VALID [2022-04-08 03:35:23,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {12182#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12182#(<= 2 main_~j~0)} is VALID [2022-04-08 03:35:23,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {12182#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12192#(<= 3 main_~j~0)} is VALID [2022-04-08 03:35:23,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {12192#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12192#(<= 3 main_~j~0)} is VALID [2022-04-08 03:35:23,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {12192#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12192#(<= 3 main_~j~0)} is VALID [2022-04-08 03:35:23,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {12192#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12202#(<= 4 main_~j~0)} is VALID [2022-04-08 03:35:23,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {12202#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12202#(<= 4 main_~j~0)} is VALID [2022-04-08 03:35:23,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {12202#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12202#(<= 4 main_~j~0)} is VALID [2022-04-08 03:35:23,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {12202#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12212#(<= 5 main_~j~0)} is VALID [2022-04-08 03:35:23,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {12212#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12212#(<= 5 main_~j~0)} is VALID [2022-04-08 03:35:23,126 INFO L290 TraceCheckUtils]: 40: Hoare triple {12212#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12212#(<= 5 main_~j~0)} is VALID [2022-04-08 03:35:23,126 INFO L290 TraceCheckUtils]: 41: Hoare triple {12212#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12222#(<= 6 main_~j~0)} is VALID [2022-04-08 03:35:23,126 INFO L290 TraceCheckUtils]: 42: Hoare triple {12222#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12222#(<= 6 main_~j~0)} is VALID [2022-04-08 03:35:23,126 INFO L290 TraceCheckUtils]: 43: Hoare triple {12222#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12222#(<= 6 main_~j~0)} is VALID [2022-04-08 03:35:23,127 INFO L290 TraceCheckUtils]: 44: Hoare triple {12222#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12232#(<= 7 main_~j~0)} is VALID [2022-04-08 03:35:23,127 INFO L290 TraceCheckUtils]: 45: Hoare triple {12232#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12232#(<= 7 main_~j~0)} is VALID [2022-04-08 03:35:23,127 INFO L290 TraceCheckUtils]: 46: Hoare triple {12232#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12232#(<= 7 main_~j~0)} is VALID [2022-04-08 03:35:23,128 INFO L290 TraceCheckUtils]: 47: Hoare triple {12232#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12242#(<= 8 main_~j~0)} is VALID [2022-04-08 03:35:23,128 INFO L290 TraceCheckUtils]: 48: Hoare triple {12242#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12242#(<= 8 main_~j~0)} is VALID [2022-04-08 03:35:23,128 INFO L290 TraceCheckUtils]: 49: Hoare triple {12242#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12242#(<= 8 main_~j~0)} is VALID [2022-04-08 03:35:23,128 INFO L290 TraceCheckUtils]: 50: Hoare triple {12242#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12252#(<= 9 main_~j~0)} is VALID [2022-04-08 03:35:23,129 INFO L290 TraceCheckUtils]: 51: Hoare triple {12252#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12252#(<= 9 main_~j~0)} is VALID [2022-04-08 03:35:23,129 INFO L290 TraceCheckUtils]: 52: Hoare triple {12252#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12252#(<= 9 main_~j~0)} is VALID [2022-04-08 03:35:23,129 INFO L290 TraceCheckUtils]: 53: Hoare triple {12252#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12262#(<= 10 main_~j~0)} is VALID [2022-04-08 03:35:23,130 INFO L290 TraceCheckUtils]: 54: Hoare triple {12262#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12266#(< 10 main_~edgecount~0)} is VALID [2022-04-08 03:35:23,130 INFO L290 TraceCheckUtils]: 55: Hoare triple {12266#(< 10 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12266#(< 10 main_~edgecount~0)} is VALID [2022-04-08 03:35:23,130 INFO L290 TraceCheckUtils]: 56: Hoare triple {12266#(< 10 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12266#(< 10 main_~edgecount~0)} is VALID [2022-04-08 03:35:23,130 INFO L290 TraceCheckUtils]: 57: Hoare triple {12266#(< 10 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {12266#(< 10 main_~edgecount~0)} is VALID [2022-04-08 03:35:23,131 INFO L290 TraceCheckUtils]: 58: Hoare triple {12266#(< 10 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12266#(< 10 main_~edgecount~0)} is VALID [2022-04-08 03:35:23,131 INFO L290 TraceCheckUtils]: 59: Hoare triple {12266#(< 10 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {12266#(< 10 main_~edgecount~0)} is VALID [2022-04-08 03:35:23,131 INFO L290 TraceCheckUtils]: 60: Hoare triple {12266#(< 10 main_~edgecount~0)} ~i~0 := 0; {12285#(and (< 10 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-08 03:35:23,132 INFO L290 TraceCheckUtils]: 61: Hoare triple {12285#(and (< 10 main_~edgecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {12285#(and (< 10 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-08 03:35:23,132 INFO L290 TraceCheckUtils]: 62: Hoare triple {12285#(and (< 10 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {12285#(and (< 10 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-08 03:35:23,132 INFO L290 TraceCheckUtils]: 63: Hoare triple {12285#(and (< 10 main_~edgecount~0) (<= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {12295#(and (< 10 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 03:35:23,133 INFO L290 TraceCheckUtils]: 64: Hoare triple {12295#(and (< 10 main_~edgecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~edgecount~0); {12072#false} is VALID [2022-04-08 03:35:23,133 INFO L290 TraceCheckUtils]: 65: Hoare triple {12072#false} ~i~0 := 0; {12072#false} is VALID [2022-04-08 03:35:23,133 INFO L290 TraceCheckUtils]: 66: Hoare triple {12072#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12072#false} is VALID [2022-04-08 03:35:23,133 INFO L272 TraceCheckUtils]: 67: Hoare triple {12072#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {12072#false} is VALID [2022-04-08 03:35:23,133 INFO L290 TraceCheckUtils]: 68: Hoare triple {12072#false} ~cond := #in~cond; {12072#false} is VALID [2022-04-08 03:35:23,133 INFO L290 TraceCheckUtils]: 69: Hoare triple {12072#false} assume 0 == ~cond; {12072#false} is VALID [2022-04-08 03:35:23,133 INFO L290 TraceCheckUtils]: 70: Hoare triple {12072#false} assume !false; {12072#false} is VALID [2022-04-08 03:35:23,133 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 146 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 03:35:23,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:23,523 INFO L290 TraceCheckUtils]: 70: Hoare triple {12072#false} assume !false; {12072#false} is VALID [2022-04-08 03:35:23,523 INFO L290 TraceCheckUtils]: 69: Hoare triple {12072#false} assume 0 == ~cond; {12072#false} is VALID [2022-04-08 03:35:23,523 INFO L290 TraceCheckUtils]: 68: Hoare triple {12072#false} ~cond := #in~cond; {12072#false} is VALID [2022-04-08 03:35:23,523 INFO L272 TraceCheckUtils]: 67: Hoare triple {12072#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {12072#false} is VALID [2022-04-08 03:35:23,523 INFO L290 TraceCheckUtils]: 66: Hoare triple {12072#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12072#false} is VALID [2022-04-08 03:35:23,523 INFO L290 TraceCheckUtils]: 65: Hoare triple {12072#false} ~i~0 := 0; {12072#false} is VALID [2022-04-08 03:35:23,523 INFO L290 TraceCheckUtils]: 64: Hoare triple {12335#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {12072#false} is VALID [2022-04-08 03:35:23,524 INFO L290 TraceCheckUtils]: 63: Hoare triple {12339#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {12335#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:35:23,524 INFO L290 TraceCheckUtils]: 62: Hoare triple {12339#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {12339#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:23,525 INFO L290 TraceCheckUtils]: 61: Hoare triple {12339#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {12339#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:23,525 INFO L290 TraceCheckUtils]: 60: Hoare triple {12349#(< 1 main_~edgecount~0)} ~i~0 := 0; {12339#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:23,525 INFO L290 TraceCheckUtils]: 59: Hoare triple {12349#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {12349#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:23,525 INFO L290 TraceCheckUtils]: 58: Hoare triple {12349#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12349#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:23,526 INFO L290 TraceCheckUtils]: 57: Hoare triple {12349#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {12349#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:23,526 INFO L290 TraceCheckUtils]: 56: Hoare triple {12349#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12349#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:23,526 INFO L290 TraceCheckUtils]: 55: Hoare triple {12349#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12349#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:23,527 INFO L290 TraceCheckUtils]: 54: Hoare triple {12172#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12349#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:23,527 INFO L290 TraceCheckUtils]: 53: Hoare triple {12162#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12172#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:23,527 INFO L290 TraceCheckUtils]: 52: Hoare triple {12162#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12162#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:23,528 INFO L290 TraceCheckUtils]: 51: Hoare triple {12162#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12162#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:23,528 INFO L290 TraceCheckUtils]: 50: Hoare triple {12380#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12162#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:23,528 INFO L290 TraceCheckUtils]: 49: Hoare triple {12380#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12380#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:35:23,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {12380#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12380#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:35:23,529 INFO L290 TraceCheckUtils]: 47: Hoare triple {12390#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12380#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:35:23,530 INFO L290 TraceCheckUtils]: 46: Hoare triple {12390#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12390#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:35:23,530 INFO L290 TraceCheckUtils]: 45: Hoare triple {12390#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12390#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:35:23,530 INFO L290 TraceCheckUtils]: 44: Hoare triple {12400#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12390#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:35:23,531 INFO L290 TraceCheckUtils]: 43: Hoare triple {12400#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12400#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:35:23,531 INFO L290 TraceCheckUtils]: 42: Hoare triple {12400#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12400#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:35:23,531 INFO L290 TraceCheckUtils]: 41: Hoare triple {12410#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12400#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:35:23,532 INFO L290 TraceCheckUtils]: 40: Hoare triple {12410#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12410#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:35:23,532 INFO L290 TraceCheckUtils]: 39: Hoare triple {12410#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12410#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:35:23,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {12420#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12410#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:35:23,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {12420#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12420#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:35:23,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {12420#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12420#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:35:23,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {12430#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12420#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:35:23,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {12430#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12430#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:35:23,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {12430#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12430#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:35:23,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {12440#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12430#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:35:23,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {12440#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12440#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:35:23,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {12440#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12440#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:35:23,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {12450#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12440#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:35:23,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {12450#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12450#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:35:23,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {12450#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12450#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:35:23,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {12460#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12450#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:35:23,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {12460#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12460#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:35:23,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {12460#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12460#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:35:23,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12460#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:35:23,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {12071#true} ~i~0 := 0; {12071#true} is VALID [2022-04-08 03:35:23,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {12071#true} assume !(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 03:35:23,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 03:35:23,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 03:35:23,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 03:35:23,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 03:35:23,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 03:35:23,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 03:35:23,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 03:35:23,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 03:35:23,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 03:35:23,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 03:35:23,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 03:35:23,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 03:35:23,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-08 03:35:23,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {12071#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-08 03:35:23,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-08 03:35:23,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {12071#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {12071#true} is VALID [2022-04-08 03:35:23,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {12071#true} call #t~ret22 := main(); {12071#true} is VALID [2022-04-08 03:35:23,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12071#true} {12071#true} #107#return; {12071#true} is VALID [2022-04-08 03:35:23,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {12071#true} assume true; {12071#true} is VALID [2022-04-08 03:35:23,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {12071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {12071#true} is VALID [2022-04-08 03:35:23,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {12071#true} call ULTIMATE.init(); {12071#true} is VALID [2022-04-08 03:35:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 146 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 03:35:23,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510463318] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:23,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:23,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2022-04-08 03:35:23,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:23,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [984072477] [2022-04-08 03:35:23,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [984072477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:23,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:23,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 03:35:23,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165510353] [2022-04-08 03:35:23,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:23,540 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-08 03:35:23,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:23,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:23,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:23,586 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 03:35:23,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:23,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 03:35:23,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1359, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 03:35:23,587 INFO L87 Difference]: Start difference. First operand 76 states and 92 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:24,219 INFO L93 Difference]: Finished difference Result 133 states and 166 transitions. [2022-04-08 03:35:24,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 03:35:24,219 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-08 03:35:24,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:24,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 109 transitions. [2022-04-08 03:35:24,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 109 transitions. [2022-04-08 03:35:24,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 109 transitions. [2022-04-08 03:35:24,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:24,305 INFO L225 Difference]: With dead ends: 133 [2022-04-08 03:35:24,305 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 03:35:24,306 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=607, Invalid=2363, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 03:35:24,306 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 175 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:24,307 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 45 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 03:35:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-04-08 03:35:24,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:24,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:24,433 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:24,433 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:24,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:24,435 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2022-04-08 03:35:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2022-04-08 03:35:24,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:24,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:24,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 81 states. [2022-04-08 03:35:24,436 INFO L87 Difference]: Start difference. First operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 81 states. [2022-04-08 03:35:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:24,437 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2022-04-08 03:35:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2022-04-08 03:35:24,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:24,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:24,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:24,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:24,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2022-04-08 03:35:24,438 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 71 [2022-04-08 03:35:24,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:24,438 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2022-04-08 03:35:24,439 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:24,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 96 transitions. [2022-04-08 03:35:24,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2022-04-08 03:35:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 03:35:24,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:24,566 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:24,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:24,766 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:24,766 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:24,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:24,766 INFO L85 PathProgramCache]: Analyzing trace with hash 237238170, now seen corresponding path program 29 times [2022-04-08 03:35:24,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:24,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2038559509] [2022-04-08 03:35:24,770 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:24,770 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:24,770 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:24,770 INFO L85 PathProgramCache]: Analyzing trace with hash 237238170, now seen corresponding path program 30 times [2022-04-08 03:35:24,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:24,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465465747] [2022-04-08 03:35:24,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:24,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:25,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:25,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {13172#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {13153#true} is VALID [2022-04-08 03:35:25,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 03:35:25,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13153#true} {13153#true} #107#return; {13153#true} is VALID [2022-04-08 03:35:25,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {13153#true} call ULTIMATE.init(); {13172#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:25,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {13172#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {13153#true} is VALID [2022-04-08 03:35:25,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 03:35:25,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13153#true} {13153#true} #107#return; {13153#true} is VALID [2022-04-08 03:35:25,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {13153#true} call #t~ret22 := main(); {13153#true} is VALID [2022-04-08 03:35:25,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {13153#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:25,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:25,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:25,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:25,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:25,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:25,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:25,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:25,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:25,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:25,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:25,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:25,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:25,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:25,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:25,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:25,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:25,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:25,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13159#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {13159#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13159#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {13159#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13159#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {13159#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13160#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:25,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {13160#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13160#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:25,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {13160#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13160#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:25,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {13160#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13161#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {13161#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13161#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {13161#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13161#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {13161#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13162#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:25,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {13162#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13162#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:25,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {13162#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13162#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:25,041 INFO L290 TraceCheckUtils]: 35: Hoare triple {13162#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13163#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:25,041 INFO L290 TraceCheckUtils]: 36: Hoare triple {13163#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13163#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:25,042 INFO L290 TraceCheckUtils]: 37: Hoare triple {13163#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13163#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:25,042 INFO L290 TraceCheckUtils]: 38: Hoare triple {13163#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13164#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:25,042 INFO L290 TraceCheckUtils]: 39: Hoare triple {13164#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13164#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:25,043 INFO L290 TraceCheckUtils]: 40: Hoare triple {13164#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13164#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:25,043 INFO L290 TraceCheckUtils]: 41: Hoare triple {13164#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13165#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,044 INFO L290 TraceCheckUtils]: 42: Hoare triple {13165#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13165#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,044 INFO L290 TraceCheckUtils]: 43: Hoare triple {13165#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13165#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,045 INFO L290 TraceCheckUtils]: 44: Hoare triple {13165#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13166#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,045 INFO L290 TraceCheckUtils]: 45: Hoare triple {13166#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13166#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,045 INFO L290 TraceCheckUtils]: 46: Hoare triple {13166#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13166#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,046 INFO L290 TraceCheckUtils]: 47: Hoare triple {13166#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13167#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,046 INFO L290 TraceCheckUtils]: 48: Hoare triple {13167#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13167#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,047 INFO L290 TraceCheckUtils]: 49: Hoare triple {13167#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13167#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,047 INFO L290 TraceCheckUtils]: 50: Hoare triple {13167#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13168#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:25,048 INFO L290 TraceCheckUtils]: 51: Hoare triple {13168#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13168#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:25,048 INFO L290 TraceCheckUtils]: 52: Hoare triple {13168#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13168#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:25,049 INFO L290 TraceCheckUtils]: 53: Hoare triple {13168#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13169#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,049 INFO L290 TraceCheckUtils]: 54: Hoare triple {13169#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13169#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,049 INFO L290 TraceCheckUtils]: 55: Hoare triple {13169#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13169#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,050 INFO L290 TraceCheckUtils]: 56: Hoare triple {13169#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13170#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,050 INFO L290 TraceCheckUtils]: 57: Hoare triple {13170#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13170#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,051 INFO L290 TraceCheckUtils]: 58: Hoare triple {13170#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13170#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,051 INFO L290 TraceCheckUtils]: 59: Hoare triple {13170#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13171#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:25,051 INFO L290 TraceCheckUtils]: 60: Hoare triple {13171#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume !(~j~0 < ~edgecount~0); {13154#false} is VALID [2022-04-08 03:35:25,052 INFO L290 TraceCheckUtils]: 61: Hoare triple {13154#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13154#false} is VALID [2022-04-08 03:35:25,052 INFO L290 TraceCheckUtils]: 62: Hoare triple {13154#false} assume !(~i~0 < ~nodecount~0); {13154#false} is VALID [2022-04-08 03:35:25,052 INFO L290 TraceCheckUtils]: 63: Hoare triple {13154#false} ~i~0 := 0; {13154#false} is VALID [2022-04-08 03:35:25,052 INFO L290 TraceCheckUtils]: 64: Hoare triple {13154#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {13154#false} is VALID [2022-04-08 03:35:25,052 INFO L290 TraceCheckUtils]: 65: Hoare triple {13154#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13154#false} is VALID [2022-04-08 03:35:25,052 INFO L290 TraceCheckUtils]: 66: Hoare triple {13154#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13154#false} is VALID [2022-04-08 03:35:25,052 INFO L290 TraceCheckUtils]: 67: Hoare triple {13154#false} assume !(~i~0 < ~edgecount~0); {13154#false} is VALID [2022-04-08 03:35:25,052 INFO L290 TraceCheckUtils]: 68: Hoare triple {13154#false} ~i~0 := 0; {13154#false} is VALID [2022-04-08 03:35:25,052 INFO L290 TraceCheckUtils]: 69: Hoare triple {13154#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13154#false} is VALID [2022-04-08 03:35:25,052 INFO L272 TraceCheckUtils]: 70: Hoare triple {13154#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {13154#false} is VALID [2022-04-08 03:35:25,052 INFO L290 TraceCheckUtils]: 71: Hoare triple {13154#false} ~cond := #in~cond; {13154#false} is VALID [2022-04-08 03:35:25,052 INFO L290 TraceCheckUtils]: 72: Hoare triple {13154#false} assume 0 == ~cond; {13154#false} is VALID [2022-04-08 03:35:25,052 INFO L290 TraceCheckUtils]: 73: Hoare triple {13154#false} assume !false; {13154#false} is VALID [2022-04-08 03:35:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 1 proven. 210 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:25,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:25,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465465747] [2022-04-08 03:35:25,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465465747] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:25,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239347850] [2022-04-08 03:35:25,053 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:35:25,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:25,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:25,054 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:25,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 03:35:25,175 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 03:35:25,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:25,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 03:35:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:25,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:25,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {13153#true} call ULTIMATE.init(); {13153#true} is VALID [2022-04-08 03:35:25,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {13153#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {13153#true} is VALID [2022-04-08 03:35:25,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 03:35:25,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13153#true} {13153#true} #107#return; {13153#true} is VALID [2022-04-08 03:35:25,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {13153#true} call #t~ret22 := main(); {13153#true} is VALID [2022-04-08 03:35:25,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {13153#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {13191#(<= 20 main_~edgecount~0)} ~i~0 := 0; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,429 INFO L290 TraceCheckUtils]: 36: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,430 INFO L290 TraceCheckUtils]: 39: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,430 INFO L290 TraceCheckUtils]: 40: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,430 INFO L290 TraceCheckUtils]: 41: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,431 INFO L290 TraceCheckUtils]: 43: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,431 INFO L290 TraceCheckUtils]: 45: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,431 INFO L290 TraceCheckUtils]: 46: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,432 INFO L290 TraceCheckUtils]: 47: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,432 INFO L290 TraceCheckUtils]: 48: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,432 INFO L290 TraceCheckUtils]: 49: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,432 INFO L290 TraceCheckUtils]: 50: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,433 INFO L290 TraceCheckUtils]: 51: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,433 INFO L290 TraceCheckUtils]: 52: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,433 INFO L290 TraceCheckUtils]: 53: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,433 INFO L290 TraceCheckUtils]: 54: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,434 INFO L290 TraceCheckUtils]: 55: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,434 INFO L290 TraceCheckUtils]: 56: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,434 INFO L290 TraceCheckUtils]: 57: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,434 INFO L290 TraceCheckUtils]: 58: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,434 INFO L290 TraceCheckUtils]: 59: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,435 INFO L290 TraceCheckUtils]: 60: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,435 INFO L290 TraceCheckUtils]: 61: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,435 INFO L290 TraceCheckUtils]: 62: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,435 INFO L290 TraceCheckUtils]: 63: Hoare triple {13191#(<= 20 main_~edgecount~0)} ~i~0 := 0; {13366#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:25,436 INFO L290 TraceCheckUtils]: 64: Hoare triple {13366#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {13366#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:25,436 INFO L290 TraceCheckUtils]: 65: Hoare triple {13366#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13366#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:25,437 INFO L290 TraceCheckUtils]: 66: Hoare triple {13366#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13376#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:25,437 INFO L290 TraceCheckUtils]: 67: Hoare triple {13376#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {13154#false} is VALID [2022-04-08 03:35:25,437 INFO L290 TraceCheckUtils]: 68: Hoare triple {13154#false} ~i~0 := 0; {13154#false} is VALID [2022-04-08 03:35:25,437 INFO L290 TraceCheckUtils]: 69: Hoare triple {13154#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13154#false} is VALID [2022-04-08 03:35:25,437 INFO L272 TraceCheckUtils]: 70: Hoare triple {13154#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {13154#false} is VALID [2022-04-08 03:35:25,437 INFO L290 TraceCheckUtils]: 71: Hoare triple {13154#false} ~cond := #in~cond; {13154#false} is VALID [2022-04-08 03:35:25,437 INFO L290 TraceCheckUtils]: 72: Hoare triple {13154#false} assume 0 == ~cond; {13154#false} is VALID [2022-04-08 03:35:25,437 INFO L290 TraceCheckUtils]: 73: Hoare triple {13154#false} assume !false; {13154#false} is VALID [2022-04-08 03:35:25,438 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-04-08 03:35:25,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:25,673 INFO L290 TraceCheckUtils]: 73: Hoare triple {13154#false} assume !false; {13154#false} is VALID [2022-04-08 03:35:25,674 INFO L290 TraceCheckUtils]: 72: Hoare triple {13154#false} assume 0 == ~cond; {13154#false} is VALID [2022-04-08 03:35:25,674 INFO L290 TraceCheckUtils]: 71: Hoare triple {13154#false} ~cond := #in~cond; {13154#false} is VALID [2022-04-08 03:35:25,674 INFO L272 TraceCheckUtils]: 70: Hoare triple {13154#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {13154#false} is VALID [2022-04-08 03:35:25,674 INFO L290 TraceCheckUtils]: 69: Hoare triple {13154#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13154#false} is VALID [2022-04-08 03:35:25,674 INFO L290 TraceCheckUtils]: 68: Hoare triple {13154#false} ~i~0 := 0; {13154#false} is VALID [2022-04-08 03:35:25,674 INFO L290 TraceCheckUtils]: 67: Hoare triple {13416#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {13154#false} is VALID [2022-04-08 03:35:25,675 INFO L290 TraceCheckUtils]: 66: Hoare triple {13420#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13416#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,675 INFO L290 TraceCheckUtils]: 65: Hoare triple {13420#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13420#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:25,675 INFO L290 TraceCheckUtils]: 64: Hoare triple {13420#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {13420#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:25,675 INFO L290 TraceCheckUtils]: 63: Hoare triple {13430#(< 1 main_~edgecount~0)} ~i~0 := 0; {13420#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:25,676 INFO L290 TraceCheckUtils]: 62: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,676 INFO L290 TraceCheckUtils]: 61: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,676 INFO L290 TraceCheckUtils]: 60: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,676 INFO L290 TraceCheckUtils]: 59: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,677 INFO L290 TraceCheckUtils]: 58: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,677 INFO L290 TraceCheckUtils]: 57: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,677 INFO L290 TraceCheckUtils]: 56: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,677 INFO L290 TraceCheckUtils]: 55: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,678 INFO L290 TraceCheckUtils]: 54: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,678 INFO L290 TraceCheckUtils]: 52: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,678 INFO L290 TraceCheckUtils]: 51: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,679 INFO L290 TraceCheckUtils]: 50: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,679 INFO L290 TraceCheckUtils]: 49: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,679 INFO L290 TraceCheckUtils]: 48: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,679 INFO L290 TraceCheckUtils]: 47: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,680 INFO L290 TraceCheckUtils]: 46: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,680 INFO L290 TraceCheckUtils]: 45: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,680 INFO L290 TraceCheckUtils]: 44: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,680 INFO L290 TraceCheckUtils]: 43: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,681 INFO L290 TraceCheckUtils]: 42: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,681 INFO L290 TraceCheckUtils]: 41: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,682 INFO L290 TraceCheckUtils]: 38: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,682 INFO L290 TraceCheckUtils]: 37: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {13430#(< 1 main_~edgecount~0)} ~i~0 := 0; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {13430#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {13153#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:25,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {13153#true} call #t~ret22 := main(); {13153#true} is VALID [2022-04-08 03:35:25,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13153#true} {13153#true} #107#return; {13153#true} is VALID [2022-04-08 03:35:25,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 03:35:25,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {13153#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {13153#true} is VALID [2022-04-08 03:35:25,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {13153#true} call ULTIMATE.init(); {13153#true} is VALID [2022-04-08 03:35:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-04-08 03:35:25,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239347850] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:25,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:25,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5, 5] total 23 [2022-04-08 03:35:25,693 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:25,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2038559509] [2022-04-08 03:35:25,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2038559509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:25,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:25,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 03:35:25,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795996102] [2022-04-08 03:35:25,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:25,698 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-08 03:35:25,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:25,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:25,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:25,739 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 03:35:25,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:25,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 03:35:25,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2022-04-08 03:35:25,740 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:26,423 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2022-04-08 03:35:26,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 03:35:26,423 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-08 03:35:26,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 113 transitions. [2022-04-08 03:35:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 113 transitions. [2022-04-08 03:35:26,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 113 transitions. [2022-04-08 03:35:26,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:26,534 INFO L225 Difference]: With dead ends: 139 [2022-04-08 03:35:26,534 INFO L226 Difference]: Without dead ends: 84 [2022-04-08 03:35:26,534 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=439, Invalid=893, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 03:35:26,535 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-08 03:35:26,535 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 55 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:35:26,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-08 03:35:26,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-04-08 03:35:26,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:26,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 82 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:26,700 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 82 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:26,700 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 82 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:26,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:26,701 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2022-04-08 03:35:26,701 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2022-04-08 03:35:26,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:26,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:26,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 84 states. [2022-04-08 03:35:26,702 INFO L87 Difference]: Start difference. First operand has 82 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 84 states. [2022-04-08 03:35:26,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:26,703 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2022-04-08 03:35:26,703 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2022-04-08 03:35:26,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:26,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:26,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:26,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:26,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2022-04-08 03:35:26,705 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 74 [2022-04-08 03:35:26,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:26,705 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2022-04-08 03:35:26,706 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:26,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 100 transitions. [2022-04-08 03:35:26,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2022-04-08 03:35:26,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-08 03:35:26,842 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:26,842 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:26,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-08 03:35:27,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:27,043 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:27,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:27,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1884900175, now seen corresponding path program 31 times [2022-04-08 03:35:27,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:27,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1075284350] [2022-04-08 03:35:27,047 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:27,047 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:27,047 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:27,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1884900175, now seen corresponding path program 32 times [2022-04-08 03:35:27,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:27,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278743897] [2022-04-08 03:35:27,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:27,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:27,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:27,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {14280#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {14260#true} is VALID [2022-04-08 03:35:27,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {14260#true} assume true; {14260#true} is VALID [2022-04-08 03:35:27,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14260#true} {14260#true} #107#return; {14260#true} is VALID [2022-04-08 03:35:27,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {14260#true} call ULTIMATE.init(); {14280#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:27,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {14280#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {14260#true} is VALID [2022-04-08 03:35:27,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {14260#true} assume true; {14260#true} is VALID [2022-04-08 03:35:27,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14260#true} {14260#true} #107#return; {14260#true} is VALID [2022-04-08 03:35:27,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {14260#true} call #t~ret22 := main(); {14260#true} is VALID [2022-04-08 03:35:27,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {14260#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:27,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:27,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:27,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:27,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:27,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:27,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:27,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:27,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:27,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:27,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:27,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:27,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:27,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:27,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:27,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:27,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:27,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {14265#(<= 20 main_~edgecount~0)} ~i~0 := 0; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:27,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14266#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:27,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {14266#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14266#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:27,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {14266#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14266#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:27,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {14266#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14267#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {14267#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14267#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {14267#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14267#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {14267#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14268#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {14268#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14268#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {14268#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14268#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {14268#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14269#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {14269#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14269#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {14269#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14269#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {14269#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14270#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {14270#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14270#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {14270#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14270#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {14270#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14271#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {14271#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14271#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {14271#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14271#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,270 INFO L290 TraceCheckUtils]: 41: Hoare triple {14271#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,272 INFO L290 TraceCheckUtils]: 46: Hoare triple {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,272 INFO L290 TraceCheckUtils]: 47: Hoare triple {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,273 INFO L290 TraceCheckUtils]: 49: Hoare triple {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,273 INFO L290 TraceCheckUtils]: 50: Hoare triple {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,274 INFO L290 TraceCheckUtils]: 51: Hoare triple {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,274 INFO L290 TraceCheckUtils]: 52: Hoare triple {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,274 INFO L290 TraceCheckUtils]: 53: Hoare triple {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,274 INFO L290 TraceCheckUtils]: 54: Hoare triple {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,275 INFO L290 TraceCheckUtils]: 55: Hoare triple {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,275 INFO L290 TraceCheckUtils]: 56: Hoare triple {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,276 INFO L290 TraceCheckUtils]: 57: Hoare triple {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,276 INFO L290 TraceCheckUtils]: 58: Hoare triple {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,276 INFO L290 TraceCheckUtils]: 59: Hoare triple {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,277 INFO L290 TraceCheckUtils]: 60: Hoare triple {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,277 INFO L290 TraceCheckUtils]: 61: Hoare triple {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,277 INFO L290 TraceCheckUtils]: 62: Hoare triple {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:27,278 INFO L290 TraceCheckUtils]: 63: Hoare triple {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {14261#false} is VALID [2022-04-08 03:35:27,278 INFO L290 TraceCheckUtils]: 64: Hoare triple {14261#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14261#false} is VALID [2022-04-08 03:35:27,278 INFO L290 TraceCheckUtils]: 65: Hoare triple {14261#false} assume !(~i~0 < ~nodecount~0); {14261#false} is VALID [2022-04-08 03:35:27,278 INFO L290 TraceCheckUtils]: 66: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-08 03:35:27,278 INFO L290 TraceCheckUtils]: 67: Hoare triple {14261#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14261#false} is VALID [2022-04-08 03:35:27,278 INFO L290 TraceCheckUtils]: 68: Hoare triple {14261#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {14261#false} is VALID [2022-04-08 03:35:27,278 INFO L290 TraceCheckUtils]: 69: Hoare triple {14261#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {14261#false} is VALID [2022-04-08 03:35:27,278 INFO L290 TraceCheckUtils]: 70: Hoare triple {14261#false} assume !(~i~0 < ~edgecount~0); {14261#false} is VALID [2022-04-08 03:35:27,278 INFO L290 TraceCheckUtils]: 71: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-08 03:35:27,278 INFO L290 TraceCheckUtils]: 72: Hoare triple {14261#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14261#false} is VALID [2022-04-08 03:35:27,278 INFO L272 TraceCheckUtils]: 73: Hoare triple {14261#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {14261#false} is VALID [2022-04-08 03:35:27,278 INFO L290 TraceCheckUtils]: 74: Hoare triple {14261#false} ~cond := #in~cond; {14261#false} is VALID [2022-04-08 03:35:27,278 INFO L290 TraceCheckUtils]: 75: Hoare triple {14261#false} assume 0 == ~cond; {14261#false} is VALID [2022-04-08 03:35:27,278 INFO L290 TraceCheckUtils]: 76: Hoare triple {14261#false} assume !false; {14261#false} is VALID [2022-04-08 03:35:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 1 proven. 247 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:27,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:27,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278743897] [2022-04-08 03:35:27,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278743897] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:27,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107702858] [2022-04-08 03:35:27,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:27,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:27,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:27,280 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:27,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 03:35:27,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:27,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:27,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 03:35:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:27,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:27,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {14260#true} call ULTIMATE.init(); {14260#true} is VALID [2022-04-08 03:35:27,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {14260#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {14260#true} is VALID [2022-04-08 03:35:27,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {14260#true} assume true; {14260#true} is VALID [2022-04-08 03:35:27,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14260#true} {14260#true} #107#return; {14260#true} is VALID [2022-04-08 03:35:27,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {14260#true} call #t~ret22 := main(); {14260#true} is VALID [2022-04-08 03:35:28,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {14260#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {14265#(<= 20 main_~edgecount~0)} ~i~0 := 0; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14353#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 03:35:28,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {14353#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14353#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 03:35:28,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {14353#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14353#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 03:35:28,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {14353#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14363#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:28,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {14363#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14363#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:28,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {14363#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14363#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:28,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {14363#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14373#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {14373#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14373#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {14373#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14373#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {14373#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14383#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:28,008 INFO L290 TraceCheckUtils]: 33: Hoare triple {14383#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14383#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:28,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {14383#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14383#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:28,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {14383#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14393#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:28,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {14393#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14393#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:28,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {14393#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14393#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:28,010 INFO L290 TraceCheckUtils]: 38: Hoare triple {14393#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14403#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:28,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {14403#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14403#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:28,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {14403#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14403#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:28,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {14403#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14413#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {14413#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14413#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,012 INFO L290 TraceCheckUtils]: 43: Hoare triple {14413#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14413#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,013 INFO L290 TraceCheckUtils]: 44: Hoare triple {14413#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14423#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,013 INFO L290 TraceCheckUtils]: 45: Hoare triple {14423#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14423#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,014 INFO L290 TraceCheckUtils]: 46: Hoare triple {14423#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14423#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,014 INFO L290 TraceCheckUtils]: 47: Hoare triple {14423#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14433#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {14433#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14433#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,015 INFO L290 TraceCheckUtils]: 49: Hoare triple {14433#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14433#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,015 INFO L290 TraceCheckUtils]: 50: Hoare triple {14433#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14443#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:28,016 INFO L290 TraceCheckUtils]: 51: Hoare triple {14443#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14443#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:28,016 INFO L290 TraceCheckUtils]: 52: Hoare triple {14443#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14443#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:28,017 INFO L290 TraceCheckUtils]: 53: Hoare triple {14443#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14453#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,017 INFO L290 TraceCheckUtils]: 54: Hoare triple {14453#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14453#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,017 INFO L290 TraceCheckUtils]: 55: Hoare triple {14453#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14453#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,018 INFO L290 TraceCheckUtils]: 56: Hoare triple {14453#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14463#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,018 INFO L290 TraceCheckUtils]: 57: Hoare triple {14463#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14463#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,019 INFO L290 TraceCheckUtils]: 58: Hoare triple {14463#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14463#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,019 INFO L290 TraceCheckUtils]: 59: Hoare triple {14463#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14473#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,019 INFO L290 TraceCheckUtils]: 60: Hoare triple {14473#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14473#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,020 INFO L290 TraceCheckUtils]: 61: Hoare triple {14473#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14473#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,020 INFO L290 TraceCheckUtils]: 62: Hoare triple {14473#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14483#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:28,021 INFO L290 TraceCheckUtils]: 63: Hoare triple {14483#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} assume !(~j~0 < ~edgecount~0); {14261#false} is VALID [2022-04-08 03:35:28,021 INFO L290 TraceCheckUtils]: 64: Hoare triple {14261#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14261#false} is VALID [2022-04-08 03:35:28,021 INFO L290 TraceCheckUtils]: 65: Hoare triple {14261#false} assume !(~i~0 < ~nodecount~0); {14261#false} is VALID [2022-04-08 03:35:28,021 INFO L290 TraceCheckUtils]: 66: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-08 03:35:28,021 INFO L290 TraceCheckUtils]: 67: Hoare triple {14261#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14261#false} is VALID [2022-04-08 03:35:28,021 INFO L290 TraceCheckUtils]: 68: Hoare triple {14261#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {14261#false} is VALID [2022-04-08 03:35:28,021 INFO L290 TraceCheckUtils]: 69: Hoare triple {14261#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {14261#false} is VALID [2022-04-08 03:35:28,021 INFO L290 TraceCheckUtils]: 70: Hoare triple {14261#false} assume !(~i~0 < ~edgecount~0); {14261#false} is VALID [2022-04-08 03:35:28,021 INFO L290 TraceCheckUtils]: 71: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-08 03:35:28,021 INFO L290 TraceCheckUtils]: 72: Hoare triple {14261#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14261#false} is VALID [2022-04-08 03:35:28,021 INFO L272 TraceCheckUtils]: 73: Hoare triple {14261#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {14261#false} is VALID [2022-04-08 03:35:28,021 INFO L290 TraceCheckUtils]: 74: Hoare triple {14261#false} ~cond := #in~cond; {14261#false} is VALID [2022-04-08 03:35:28,021 INFO L290 TraceCheckUtils]: 75: Hoare triple {14261#false} assume 0 == ~cond; {14261#false} is VALID [2022-04-08 03:35:28,021 INFO L290 TraceCheckUtils]: 76: Hoare triple {14261#false} assume !false; {14261#false} is VALID [2022-04-08 03:35:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 1 proven. 247 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:28,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:28,440 INFO L290 TraceCheckUtils]: 76: Hoare triple {14261#false} assume !false; {14261#false} is VALID [2022-04-08 03:35:28,440 INFO L290 TraceCheckUtils]: 75: Hoare triple {14261#false} assume 0 == ~cond; {14261#false} is VALID [2022-04-08 03:35:28,440 INFO L290 TraceCheckUtils]: 74: Hoare triple {14261#false} ~cond := #in~cond; {14261#false} is VALID [2022-04-08 03:35:28,440 INFO L272 TraceCheckUtils]: 73: Hoare triple {14261#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {14261#false} is VALID [2022-04-08 03:35:28,440 INFO L290 TraceCheckUtils]: 72: Hoare triple {14261#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14261#false} is VALID [2022-04-08 03:35:28,440 INFO L290 TraceCheckUtils]: 71: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-08 03:35:28,440 INFO L290 TraceCheckUtils]: 70: Hoare triple {14261#false} assume !(~i~0 < ~edgecount~0); {14261#false} is VALID [2022-04-08 03:35:28,440 INFO L290 TraceCheckUtils]: 69: Hoare triple {14261#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {14261#false} is VALID [2022-04-08 03:35:28,440 INFO L290 TraceCheckUtils]: 68: Hoare triple {14261#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {14261#false} is VALID [2022-04-08 03:35:28,441 INFO L290 TraceCheckUtils]: 67: Hoare triple {14261#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14261#false} is VALID [2022-04-08 03:35:28,441 INFO L290 TraceCheckUtils]: 66: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-08 03:35:28,441 INFO L290 TraceCheckUtils]: 65: Hoare triple {14261#false} assume !(~i~0 < ~nodecount~0); {14261#false} is VALID [2022-04-08 03:35:28,441 INFO L290 TraceCheckUtils]: 64: Hoare triple {14261#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14261#false} is VALID [2022-04-08 03:35:28,441 INFO L290 TraceCheckUtils]: 63: Hoare triple {14565#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {14261#false} is VALID [2022-04-08 03:35:28,441 INFO L290 TraceCheckUtils]: 62: Hoare triple {14569#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14565#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,442 INFO L290 TraceCheckUtils]: 61: Hoare triple {14569#(< (+ main_~j~0 1) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14569#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,442 INFO L290 TraceCheckUtils]: 60: Hoare triple {14569#(< (+ main_~j~0 1) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14569#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,442 INFO L290 TraceCheckUtils]: 59: Hoare triple {14579#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14569#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,443 INFO L290 TraceCheckUtils]: 58: Hoare triple {14579#(< (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14579#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,443 INFO L290 TraceCheckUtils]: 57: Hoare triple {14579#(< (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14579#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,443 INFO L290 TraceCheckUtils]: 56: Hoare triple {14589#(< (+ main_~j~0 3) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14579#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {14589#(< (+ main_~j~0 3) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14589#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {14589#(< (+ main_~j~0 3) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14589#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,444 INFO L290 TraceCheckUtils]: 53: Hoare triple {14599#(< (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14589#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,445 INFO L290 TraceCheckUtils]: 52: Hoare triple {14599#(< (+ main_~j~0 4) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14599#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,445 INFO L290 TraceCheckUtils]: 51: Hoare triple {14599#(< (+ main_~j~0 4) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14599#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,445 INFO L290 TraceCheckUtils]: 50: Hoare triple {14609#(< (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14599#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,446 INFO L290 TraceCheckUtils]: 49: Hoare triple {14609#(< (+ 5 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14609#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,446 INFO L290 TraceCheckUtils]: 48: Hoare triple {14609#(< (+ 5 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14609#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,446 INFO L290 TraceCheckUtils]: 47: Hoare triple {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14609#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,447 INFO L290 TraceCheckUtils]: 45: Hoare triple {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,447 INFO L290 TraceCheckUtils]: 44: Hoare triple {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,447 INFO L290 TraceCheckUtils]: 43: Hoare triple {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,448 INFO L290 TraceCheckUtils]: 41: Hoare triple {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,449 INFO L290 TraceCheckUtils]: 39: Hoare triple {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,449 INFO L290 TraceCheckUtils]: 38: Hoare triple {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,449 INFO L290 TraceCheckUtils]: 37: Hoare triple {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,449 INFO L290 TraceCheckUtils]: 36: Hoare triple {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,450 INFO L290 TraceCheckUtils]: 35: Hoare triple {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:28,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {14691#(<= 14 main_~edgecount~0)} ~i~0 := 0; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {14691#(<= 14 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {14691#(<= 14 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {14691#(<= 14 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {14691#(<= 14 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {14691#(<= 14 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {14260#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-08 03:35:28,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {14260#true} call #t~ret22 := main(); {14260#true} is VALID [2022-04-08 03:35:28,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14260#true} {14260#true} #107#return; {14260#true} is VALID [2022-04-08 03:35:28,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {14260#true} assume true; {14260#true} is VALID [2022-04-08 03:35:28,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {14260#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {14260#true} is VALID [2022-04-08 03:35:28,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {14260#true} call ULTIMATE.init(); {14260#true} is VALID [2022-04-08 03:35:28,459 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 1 proven. 247 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:28,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107702858] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:28,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:28,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 39 [2022-04-08 03:35:28,460 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:28,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1075284350] [2022-04-08 03:35:28,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1075284350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:28,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:28,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 03:35:28,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095571978] [2022-04-08 03:35:28,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:28,461 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-08 03:35:28,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:28,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:28,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:28,503 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 03:35:28,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:28,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 03:35:28,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=589, Invalid=893, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 03:35:28,504 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:29,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:29,284 INFO L93 Difference]: Finished difference Result 145 states and 182 transitions. [2022-04-08 03:35:29,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 03:35:29,285 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-08 03:35:29,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-04-08 03:35:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:29,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-04-08 03:35:29,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 117 transitions. [2022-04-08 03:35:29,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:29,381 INFO L225 Difference]: With dead ends: 145 [2022-04-08 03:35:29,381 INFO L226 Difference]: Without dead ends: 87 [2022-04-08 03:35:29,382 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=972, Invalid=1890, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 03:35:29,382 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 187 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:29,383 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 55 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:35:29,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-08 03:35:29,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2022-04-08 03:35:29,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:29,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 85 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:29,531 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 85 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:29,531 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 85 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:29,532 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2022-04-08 03:35:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2022-04-08 03:35:29,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:29,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:29,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 87 states. [2022-04-08 03:35:29,533 INFO L87 Difference]: Start difference. First operand has 85 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 87 states. [2022-04-08 03:35:29,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:29,534 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2022-04-08 03:35:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2022-04-08 03:35:29,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:29,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:29,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:29,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2022-04-08 03:35:29,536 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 77 [2022-04-08 03:35:29,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:29,536 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2022-04-08 03:35:29,536 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:29,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 104 transitions. [2022-04-08 03:35:29,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2022-04-08 03:35:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-08 03:35:29,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:29,670 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:29,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:29,870 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:29,870 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:29,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:29,871 INFO L85 PathProgramCache]: Analyzing trace with hash -589738950, now seen corresponding path program 33 times [2022-04-08 03:35:29,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:29,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [688593550] [2022-04-08 03:35:29,874 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:29,874 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:29,874 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:29,874 INFO L85 PathProgramCache]: Analyzing trace with hash -589738950, now seen corresponding path program 34 times [2022-04-08 03:35:29,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:29,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131340050] [2022-04-08 03:35:29,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:29,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:30,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:30,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {15448#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {15427#true} is VALID [2022-04-08 03:35:30,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {15427#true} assume true; {15427#true} is VALID [2022-04-08 03:35:30,124 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15427#true} {15427#true} #107#return; {15427#true} is VALID [2022-04-08 03:35:30,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {15427#true} call ULTIMATE.init(); {15448#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:30,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {15448#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {15427#true} is VALID [2022-04-08 03:35:30,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {15427#true} assume true; {15427#true} is VALID [2022-04-08 03:35:30,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15427#true} {15427#true} #107#return; {15427#true} is VALID [2022-04-08 03:35:30,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {15427#true} call #t~ret22 := main(); {15427#true} is VALID [2022-04-08 03:35:30,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {15427#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:30,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:30,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:30,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:30,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:30,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:30,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:30,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:30,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:30,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:30,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:30,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:30,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:30,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:30,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:30,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:30,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:30,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:30,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {15433#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {15433#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15433#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {15433#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15433#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {15433#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:30,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {15434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:30,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {15434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:30,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {15434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15435#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {15435#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15435#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {15435#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15435#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {15435#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15436#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:30,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {15436#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15436#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:30,136 INFO L290 TraceCheckUtils]: 34: Hoare triple {15436#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15436#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:30,137 INFO L290 TraceCheckUtils]: 35: Hoare triple {15436#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15437#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:30,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {15437#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15437#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:30,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {15437#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15437#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:30,138 INFO L290 TraceCheckUtils]: 38: Hoare triple {15437#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15438#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:30,138 INFO L290 TraceCheckUtils]: 39: Hoare triple {15438#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15438#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:30,139 INFO L290 TraceCheckUtils]: 40: Hoare triple {15438#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15438#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:30,139 INFO L290 TraceCheckUtils]: 41: Hoare triple {15438#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15439#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,140 INFO L290 TraceCheckUtils]: 42: Hoare triple {15439#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15439#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,140 INFO L290 TraceCheckUtils]: 43: Hoare triple {15439#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15439#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {15439#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15440#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,141 INFO L290 TraceCheckUtils]: 45: Hoare triple {15440#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15440#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,141 INFO L290 TraceCheckUtils]: 46: Hoare triple {15440#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15440#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,142 INFO L290 TraceCheckUtils]: 47: Hoare triple {15440#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15441#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,142 INFO L290 TraceCheckUtils]: 48: Hoare triple {15441#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15441#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,143 INFO L290 TraceCheckUtils]: 49: Hoare triple {15441#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15441#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,143 INFO L290 TraceCheckUtils]: 50: Hoare triple {15441#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15442#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:30,144 INFO L290 TraceCheckUtils]: 51: Hoare triple {15442#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15442#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:30,144 INFO L290 TraceCheckUtils]: 52: Hoare triple {15442#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15442#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:30,144 INFO L290 TraceCheckUtils]: 53: Hoare triple {15442#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15443#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,145 INFO L290 TraceCheckUtils]: 54: Hoare triple {15443#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15443#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,145 INFO L290 TraceCheckUtils]: 55: Hoare triple {15443#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15443#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,146 INFO L290 TraceCheckUtils]: 56: Hoare triple {15443#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15444#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,146 INFO L290 TraceCheckUtils]: 57: Hoare triple {15444#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15444#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,147 INFO L290 TraceCheckUtils]: 58: Hoare triple {15444#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15444#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,147 INFO L290 TraceCheckUtils]: 59: Hoare triple {15444#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15445#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,148 INFO L290 TraceCheckUtils]: 60: Hoare triple {15445#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15445#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,148 INFO L290 TraceCheckUtils]: 61: Hoare triple {15445#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15445#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,148 INFO L290 TraceCheckUtils]: 62: Hoare triple {15445#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15446#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,149 INFO L290 TraceCheckUtils]: 63: Hoare triple {15446#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15446#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,149 INFO L290 TraceCheckUtils]: 64: Hoare triple {15446#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15446#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,150 INFO L290 TraceCheckUtils]: 65: Hoare triple {15446#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15447#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:30,150 INFO L290 TraceCheckUtils]: 66: Hoare triple {15447#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume !(~j~0 < ~edgecount~0); {15428#false} is VALID [2022-04-08 03:35:30,150 INFO L290 TraceCheckUtils]: 67: Hoare triple {15428#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15428#false} is VALID [2022-04-08 03:35:30,150 INFO L290 TraceCheckUtils]: 68: Hoare triple {15428#false} assume !(~i~0 < ~nodecount~0); {15428#false} is VALID [2022-04-08 03:35:30,150 INFO L290 TraceCheckUtils]: 69: Hoare triple {15428#false} ~i~0 := 0; {15428#false} is VALID [2022-04-08 03:35:30,150 INFO L290 TraceCheckUtils]: 70: Hoare triple {15428#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {15428#false} is VALID [2022-04-08 03:35:30,150 INFO L290 TraceCheckUtils]: 71: Hoare triple {15428#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {15428#false} is VALID [2022-04-08 03:35:30,151 INFO L290 TraceCheckUtils]: 72: Hoare triple {15428#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15428#false} is VALID [2022-04-08 03:35:30,151 INFO L290 TraceCheckUtils]: 73: Hoare triple {15428#false} assume !(~i~0 < ~edgecount~0); {15428#false} is VALID [2022-04-08 03:35:30,151 INFO L290 TraceCheckUtils]: 74: Hoare triple {15428#false} ~i~0 := 0; {15428#false} is VALID [2022-04-08 03:35:30,151 INFO L290 TraceCheckUtils]: 75: Hoare triple {15428#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15428#false} is VALID [2022-04-08 03:35:30,151 INFO L272 TraceCheckUtils]: 76: Hoare triple {15428#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {15428#false} is VALID [2022-04-08 03:35:30,151 INFO L290 TraceCheckUtils]: 77: Hoare triple {15428#false} ~cond := #in~cond; {15428#false} is VALID [2022-04-08 03:35:30,151 INFO L290 TraceCheckUtils]: 78: Hoare triple {15428#false} assume 0 == ~cond; {15428#false} is VALID [2022-04-08 03:35:30,151 INFO L290 TraceCheckUtils]: 79: Hoare triple {15428#false} assume !false; {15428#false} is VALID [2022-04-08 03:35:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:30,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:30,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131340050] [2022-04-08 03:35:30,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131340050] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:30,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79888259] [2022-04-08 03:35:30,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:35:30,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:30,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:30,153 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:30,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 03:35:30,287 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:35:30,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:30,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 03:35:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:30,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:30,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {15427#true} call ULTIMATE.init(); {15427#true} is VALID [2022-04-08 03:35:30,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {15427#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {15427#true} is VALID [2022-04-08 03:35:30,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {15427#true} assume true; {15427#true} is VALID [2022-04-08 03:35:30,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15427#true} {15427#true} #107#return; {15427#true} is VALID [2022-04-08 03:35:30,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {15427#true} call #t~ret22 := main(); {15427#true} is VALID [2022-04-08 03:35:30,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {15427#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {15427#true} is VALID [2022-04-08 03:35:30,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 03:35:30,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {15427#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 03:35:30,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 03:35:30,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 03:35:30,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 03:35:30,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 03:35:30,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 03:35:30,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 03:35:30,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 03:35:30,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 03:35:30,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 03:35:30,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 03:35:30,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 03:35:30,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 03:35:30,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 03:35:30,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {15427#true} assume !(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 03:35:30,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {15427#true} ~i~0 := 0; {15427#true} is VALID [2022-04-08 03:35:30,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {15521#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:30,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {15521#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15521#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:30,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {15521#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15521#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:30,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {15521#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15531#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:30,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {15531#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15531#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:30,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {15531#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15531#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:30,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {15531#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15541#(<= 2 main_~j~0)} is VALID [2022-04-08 03:35:30,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {15541#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15541#(<= 2 main_~j~0)} is VALID [2022-04-08 03:35:30,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {15541#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15541#(<= 2 main_~j~0)} is VALID [2022-04-08 03:35:30,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {15541#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15551#(<= 3 main_~j~0)} is VALID [2022-04-08 03:35:30,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {15551#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15551#(<= 3 main_~j~0)} is VALID [2022-04-08 03:35:30,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {15551#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15551#(<= 3 main_~j~0)} is VALID [2022-04-08 03:35:30,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {15551#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15561#(<= 4 main_~j~0)} is VALID [2022-04-08 03:35:30,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {15561#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15561#(<= 4 main_~j~0)} is VALID [2022-04-08 03:35:30,795 INFO L290 TraceCheckUtils]: 37: Hoare triple {15561#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15561#(<= 4 main_~j~0)} is VALID [2022-04-08 03:35:30,795 INFO L290 TraceCheckUtils]: 38: Hoare triple {15561#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15571#(<= 5 main_~j~0)} is VALID [2022-04-08 03:35:30,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {15571#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15571#(<= 5 main_~j~0)} is VALID [2022-04-08 03:35:30,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {15571#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15571#(<= 5 main_~j~0)} is VALID [2022-04-08 03:35:30,796 INFO L290 TraceCheckUtils]: 41: Hoare triple {15571#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15581#(<= 6 main_~j~0)} is VALID [2022-04-08 03:35:30,796 INFO L290 TraceCheckUtils]: 42: Hoare triple {15581#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15581#(<= 6 main_~j~0)} is VALID [2022-04-08 03:35:30,796 INFO L290 TraceCheckUtils]: 43: Hoare triple {15581#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15581#(<= 6 main_~j~0)} is VALID [2022-04-08 03:35:30,797 INFO L290 TraceCheckUtils]: 44: Hoare triple {15581#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15591#(<= 7 main_~j~0)} is VALID [2022-04-08 03:35:30,797 INFO L290 TraceCheckUtils]: 45: Hoare triple {15591#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15591#(<= 7 main_~j~0)} is VALID [2022-04-08 03:35:30,797 INFO L290 TraceCheckUtils]: 46: Hoare triple {15591#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15591#(<= 7 main_~j~0)} is VALID [2022-04-08 03:35:30,797 INFO L290 TraceCheckUtils]: 47: Hoare triple {15591#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15601#(<= 8 main_~j~0)} is VALID [2022-04-08 03:35:30,798 INFO L290 TraceCheckUtils]: 48: Hoare triple {15601#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15601#(<= 8 main_~j~0)} is VALID [2022-04-08 03:35:30,798 INFO L290 TraceCheckUtils]: 49: Hoare triple {15601#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15601#(<= 8 main_~j~0)} is VALID [2022-04-08 03:35:30,798 INFO L290 TraceCheckUtils]: 50: Hoare triple {15601#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15611#(<= 9 main_~j~0)} is VALID [2022-04-08 03:35:30,798 INFO L290 TraceCheckUtils]: 51: Hoare triple {15611#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15611#(<= 9 main_~j~0)} is VALID [2022-04-08 03:35:30,799 INFO L290 TraceCheckUtils]: 52: Hoare triple {15611#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15611#(<= 9 main_~j~0)} is VALID [2022-04-08 03:35:30,799 INFO L290 TraceCheckUtils]: 53: Hoare triple {15611#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15621#(<= 10 main_~j~0)} is VALID [2022-04-08 03:35:30,799 INFO L290 TraceCheckUtils]: 54: Hoare triple {15621#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15621#(<= 10 main_~j~0)} is VALID [2022-04-08 03:35:30,799 INFO L290 TraceCheckUtils]: 55: Hoare triple {15621#(<= 10 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15621#(<= 10 main_~j~0)} is VALID [2022-04-08 03:35:30,800 INFO L290 TraceCheckUtils]: 56: Hoare triple {15621#(<= 10 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15631#(<= 11 main_~j~0)} is VALID [2022-04-08 03:35:30,800 INFO L290 TraceCheckUtils]: 57: Hoare triple {15631#(<= 11 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15631#(<= 11 main_~j~0)} is VALID [2022-04-08 03:35:30,800 INFO L290 TraceCheckUtils]: 58: Hoare triple {15631#(<= 11 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15631#(<= 11 main_~j~0)} is VALID [2022-04-08 03:35:30,801 INFO L290 TraceCheckUtils]: 59: Hoare triple {15631#(<= 11 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15641#(<= 12 main_~j~0)} is VALID [2022-04-08 03:35:30,801 INFO L290 TraceCheckUtils]: 60: Hoare triple {15641#(<= 12 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15641#(<= 12 main_~j~0)} is VALID [2022-04-08 03:35:30,801 INFO L290 TraceCheckUtils]: 61: Hoare triple {15641#(<= 12 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15641#(<= 12 main_~j~0)} is VALID [2022-04-08 03:35:30,802 INFO L290 TraceCheckUtils]: 62: Hoare triple {15641#(<= 12 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15651#(<= 13 main_~j~0)} is VALID [2022-04-08 03:35:30,802 INFO L290 TraceCheckUtils]: 63: Hoare triple {15651#(<= 13 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15655#(< 13 main_~edgecount~0)} is VALID [2022-04-08 03:35:30,802 INFO L290 TraceCheckUtils]: 64: Hoare triple {15655#(< 13 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15655#(< 13 main_~edgecount~0)} is VALID [2022-04-08 03:35:30,803 INFO L290 TraceCheckUtils]: 65: Hoare triple {15655#(< 13 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15655#(< 13 main_~edgecount~0)} is VALID [2022-04-08 03:35:30,803 INFO L290 TraceCheckUtils]: 66: Hoare triple {15655#(< 13 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {15655#(< 13 main_~edgecount~0)} is VALID [2022-04-08 03:35:30,803 INFO L290 TraceCheckUtils]: 67: Hoare triple {15655#(< 13 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15655#(< 13 main_~edgecount~0)} is VALID [2022-04-08 03:35:30,803 INFO L290 TraceCheckUtils]: 68: Hoare triple {15655#(< 13 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {15655#(< 13 main_~edgecount~0)} is VALID [2022-04-08 03:35:30,804 INFO L290 TraceCheckUtils]: 69: Hoare triple {15655#(< 13 main_~edgecount~0)} ~i~0 := 0; {15674#(and (<= main_~i~0 0) (< 13 main_~edgecount~0))} is VALID [2022-04-08 03:35:30,804 INFO L290 TraceCheckUtils]: 70: Hoare triple {15674#(and (<= main_~i~0 0) (< 13 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {15674#(and (<= main_~i~0 0) (< 13 main_~edgecount~0))} is VALID [2022-04-08 03:35:30,804 INFO L290 TraceCheckUtils]: 71: Hoare triple {15674#(and (<= main_~i~0 0) (< 13 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {15674#(and (<= main_~i~0 0) (< 13 main_~edgecount~0))} is VALID [2022-04-08 03:35:30,805 INFO L290 TraceCheckUtils]: 72: Hoare triple {15674#(and (<= main_~i~0 0) (< 13 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15684#(and (<= main_~i~0 1) (< 13 main_~edgecount~0))} is VALID [2022-04-08 03:35:30,805 INFO L290 TraceCheckUtils]: 73: Hoare triple {15684#(and (<= main_~i~0 1) (< 13 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {15428#false} is VALID [2022-04-08 03:35:30,805 INFO L290 TraceCheckUtils]: 74: Hoare triple {15428#false} ~i~0 := 0; {15428#false} is VALID [2022-04-08 03:35:30,805 INFO L290 TraceCheckUtils]: 75: Hoare triple {15428#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15428#false} is VALID [2022-04-08 03:35:30,805 INFO L272 TraceCheckUtils]: 76: Hoare triple {15428#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {15428#false} is VALID [2022-04-08 03:35:30,805 INFO L290 TraceCheckUtils]: 77: Hoare triple {15428#false} ~cond := #in~cond; {15428#false} is VALID [2022-04-08 03:35:30,805 INFO L290 TraceCheckUtils]: 78: Hoare triple {15428#false} assume 0 == ~cond; {15428#false} is VALID [2022-04-08 03:35:30,805 INFO L290 TraceCheckUtils]: 79: Hoare triple {15428#false} assume !false; {15428#false} is VALID [2022-04-08 03:35:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 248 proven. 41 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 03:35:30,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:31,251 INFO L290 TraceCheckUtils]: 79: Hoare triple {15428#false} assume !false; {15428#false} is VALID [2022-04-08 03:35:31,251 INFO L290 TraceCheckUtils]: 78: Hoare triple {15428#false} assume 0 == ~cond; {15428#false} is VALID [2022-04-08 03:35:31,252 INFO L290 TraceCheckUtils]: 77: Hoare triple {15428#false} ~cond := #in~cond; {15428#false} is VALID [2022-04-08 03:35:31,252 INFO L272 TraceCheckUtils]: 76: Hoare triple {15428#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {15428#false} is VALID [2022-04-08 03:35:31,252 INFO L290 TraceCheckUtils]: 75: Hoare triple {15428#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15428#false} is VALID [2022-04-08 03:35:31,252 INFO L290 TraceCheckUtils]: 74: Hoare triple {15428#false} ~i~0 := 0; {15428#false} is VALID [2022-04-08 03:35:31,252 INFO L290 TraceCheckUtils]: 73: Hoare triple {15724#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {15428#false} is VALID [2022-04-08 03:35:31,253 INFO L290 TraceCheckUtils]: 72: Hoare triple {15728#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15724#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:35:31,253 INFO L290 TraceCheckUtils]: 71: Hoare triple {15728#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {15728#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:31,253 INFO L290 TraceCheckUtils]: 70: Hoare triple {15728#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {15728#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:31,253 INFO L290 TraceCheckUtils]: 69: Hoare triple {15738#(< 1 main_~edgecount~0)} ~i~0 := 0; {15728#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:31,254 INFO L290 TraceCheckUtils]: 68: Hoare triple {15738#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {15738#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:31,254 INFO L290 TraceCheckUtils]: 67: Hoare triple {15738#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15738#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:31,254 INFO L290 TraceCheckUtils]: 66: Hoare triple {15738#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {15738#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:31,254 INFO L290 TraceCheckUtils]: 65: Hoare triple {15738#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15738#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:31,255 INFO L290 TraceCheckUtils]: 64: Hoare triple {15738#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15738#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:31,255 INFO L290 TraceCheckUtils]: 63: Hoare triple {15531#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15738#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:31,256 INFO L290 TraceCheckUtils]: 62: Hoare triple {15521#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15531#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:31,256 INFO L290 TraceCheckUtils]: 61: Hoare triple {15521#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15521#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:31,256 INFO L290 TraceCheckUtils]: 60: Hoare triple {15521#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15521#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:31,257 INFO L290 TraceCheckUtils]: 59: Hoare triple {15769#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15521#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:31,257 INFO L290 TraceCheckUtils]: 58: Hoare triple {15769#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15769#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:35:31,257 INFO L290 TraceCheckUtils]: 57: Hoare triple {15769#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15769#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:35:31,258 INFO L290 TraceCheckUtils]: 56: Hoare triple {15779#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15769#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:35:31,258 INFO L290 TraceCheckUtils]: 55: Hoare triple {15779#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15779#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:35:31,259 INFO L290 TraceCheckUtils]: 54: Hoare triple {15779#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15779#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:35:31,259 INFO L290 TraceCheckUtils]: 53: Hoare triple {15789#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15779#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:35:31,259 INFO L290 TraceCheckUtils]: 52: Hoare triple {15789#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15789#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:35:31,260 INFO L290 TraceCheckUtils]: 51: Hoare triple {15789#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15789#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:35:31,260 INFO L290 TraceCheckUtils]: 50: Hoare triple {15799#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15789#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:35:31,260 INFO L290 TraceCheckUtils]: 49: Hoare triple {15799#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15799#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:35:31,261 INFO L290 TraceCheckUtils]: 48: Hoare triple {15799#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15799#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:35:31,261 INFO L290 TraceCheckUtils]: 47: Hoare triple {15809#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15799#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:35:31,261 INFO L290 TraceCheckUtils]: 46: Hoare triple {15809#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15809#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:35:31,262 INFO L290 TraceCheckUtils]: 45: Hoare triple {15809#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15809#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:35:31,262 INFO L290 TraceCheckUtils]: 44: Hoare triple {15819#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15809#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:35:31,262 INFO L290 TraceCheckUtils]: 43: Hoare triple {15819#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15819#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:35:31,263 INFO L290 TraceCheckUtils]: 42: Hoare triple {15819#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15819#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:35:31,263 INFO L290 TraceCheckUtils]: 41: Hoare triple {15829#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15819#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:35:31,264 INFO L290 TraceCheckUtils]: 40: Hoare triple {15829#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15829#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:35:31,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {15829#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15829#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:35:31,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {15839#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15829#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:35:31,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {15839#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15839#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:35:31,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {15839#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15839#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:35:31,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {15849#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15839#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:35:31,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {15849#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15849#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:35:31,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {15849#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15849#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:35:31,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {15859#(<= 0 (+ main_~j~0 10))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15849#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:35:31,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {15859#(<= 0 (+ main_~j~0 10))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15859#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 03:35:31,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {15859#(<= 0 (+ main_~j~0 10))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15859#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 03:35:31,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {15869#(<= 0 (+ main_~j~0 11))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15859#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 03:35:31,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {15869#(<= 0 (+ main_~j~0 11))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15869#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 03:35:31,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {15869#(<= 0 (+ main_~j~0 11))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15869#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 03:35:31,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {15879#(<= 0 (+ main_~j~0 12))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15869#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 03:35:31,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {15879#(<= 0 (+ main_~j~0 12))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15879#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 03:35:31,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {15879#(<= 0 (+ main_~j~0 12))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15879#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 03:35:31,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {15879#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 03:35:31,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {15427#true} ~i~0 := 0; {15427#true} is VALID [2022-04-08 03:35:31,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {15427#true} assume !(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 03:35:31,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 03:35:31,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 03:35:31,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 03:35:31,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 03:35:31,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 03:35:31,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 03:35:31,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 03:35:31,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 03:35:31,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 03:35:31,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 03:35:31,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 03:35:31,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 03:35:31,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-08 03:35:31,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {15427#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-08 03:35:31,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-08 03:35:31,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {15427#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {15427#true} is VALID [2022-04-08 03:35:31,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {15427#true} call #t~ret22 := main(); {15427#true} is VALID [2022-04-08 03:35:31,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15427#true} {15427#true} #107#return; {15427#true} is VALID [2022-04-08 03:35:31,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {15427#true} assume true; {15427#true} is VALID [2022-04-08 03:35:31,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {15427#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {15427#true} is VALID [2022-04-08 03:35:31,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {15427#true} call ULTIMATE.init(); {15427#true} is VALID [2022-04-08 03:35:31,279 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 248 proven. 41 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 03:35:31,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79888259] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:31,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:31,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 51 [2022-04-08 03:35:31,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:31,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [688593550] [2022-04-08 03:35:31,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [688593550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:31,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:31,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 03:35:31,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230139134] [2022-04-08 03:35:31,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:31,280 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-08 03:35:31,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:31,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:31,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:31,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 03:35:31,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:31,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 03:35:31,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=1950, Unknown=0, NotChecked=0, Total=2550 [2022-04-08 03:35:31,348 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:32,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:32,176 INFO L93 Difference]: Finished difference Result 151 states and 190 transitions. [2022-04-08 03:35:32,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 03:35:32,176 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-08 03:35:32,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:32,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:32,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 121 transitions. [2022-04-08 03:35:32,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:32,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 121 transitions. [2022-04-08 03:35:32,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 121 transitions. [2022-04-08 03:35:32,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:32,276 INFO L225 Difference]: With dead ends: 151 [2022-04-08 03:35:32,276 INFO L226 Difference]: Without dead ends: 90 [2022-04-08 03:35:32,277 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-08 03:35:32,277 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 209 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:32,277 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 40 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:32,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-08 03:35:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2022-04-08 03:35:32,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:32,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 88 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:32,427 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 88 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:32,428 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 88 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:32,428 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2022-04-08 03:35:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2022-04-08 03:35:32,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:32,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:32,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 90 states. [2022-04-08 03:35:32,429 INFO L87 Difference]: Start difference. First operand has 88 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 90 states. [2022-04-08 03:35:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:32,430 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2022-04-08 03:35:32,430 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2022-04-08 03:35:32,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:32,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:32,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:32,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2022-04-08 03:35:32,431 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 80 [2022-04-08 03:35:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:32,431 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2022-04-08 03:35:32,431 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:32,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 108 transitions. [2022-04-08 03:35:32,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2022-04-08 03:35:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-08 03:35:32,572 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:32,572 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:32,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:32,772 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:32,772 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:32,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1867095057, now seen corresponding path program 35 times [2022-04-08 03:35:32,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:32,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [198587753] [2022-04-08 03:35:32,776 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:32,776 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:32,776 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:32,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1867095057, now seen corresponding path program 36 times [2022-04-08 03:35:32,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:32,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520082335] [2022-04-08 03:35:32,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:32,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:32,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:32,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {16672#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {16650#true} is VALID [2022-04-08 03:35:32,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {16650#true} assume true; {16650#true} is VALID [2022-04-08 03:35:32,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16650#true} {16650#true} #107#return; {16650#true} is VALID [2022-04-08 03:35:32,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {16650#true} call ULTIMATE.init(); {16672#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:32,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {16672#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {16650#true} is VALID [2022-04-08 03:35:32,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {16650#true} assume true; {16650#true} is VALID [2022-04-08 03:35:32,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16650#true} {16650#true} #107#return; {16650#true} is VALID [2022-04-08 03:35:32,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {16650#true} call #t~ret22 := main(); {16650#true} is VALID [2022-04-08 03:35:32,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {16650#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:32,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:32,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:32,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {16655#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:33,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:33,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:33,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {16655#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:33,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:33,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:33,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {16655#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:33,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:33,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:33,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {16655#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:33,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:33,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:33,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {16655#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:33,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:33,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {16655#(<= 20 main_~edgecount~0)} ~i~0 := 0; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:33,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:33,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {16656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:33,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {16656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:33,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {16656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16657#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {16657#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16657#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {16657#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16657#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {16657#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16658#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {16658#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16658#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {16658#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16658#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {16658#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16659#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {16659#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16659#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {16659#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16659#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,010 INFO L290 TraceCheckUtils]: 35: Hoare triple {16659#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16660#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {16660#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16660#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {16660#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16660#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {16660#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16661#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {16661#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16661#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {16661#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16661#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,013 INFO L290 TraceCheckUtils]: 41: Hoare triple {16661#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16662#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,013 INFO L290 TraceCheckUtils]: 42: Hoare triple {16662#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16662#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,014 INFO L290 TraceCheckUtils]: 43: Hoare triple {16662#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16662#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {16662#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16663#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,015 INFO L290 TraceCheckUtils]: 45: Hoare triple {16663#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16663#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,015 INFO L290 TraceCheckUtils]: 46: Hoare triple {16663#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16663#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {16663#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16664#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,016 INFO L290 TraceCheckUtils]: 48: Hoare triple {16664#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16664#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,016 INFO L290 TraceCheckUtils]: 49: Hoare triple {16664#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16664#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,017 INFO L290 TraceCheckUtils]: 50: Hoare triple {16664#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16665#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,017 INFO L290 TraceCheckUtils]: 51: Hoare triple {16665#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16665#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,017 INFO L290 TraceCheckUtils]: 52: Hoare triple {16665#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16665#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,018 INFO L290 TraceCheckUtils]: 53: Hoare triple {16665#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16666#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,018 INFO L290 TraceCheckUtils]: 54: Hoare triple {16666#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16666#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,018 INFO L290 TraceCheckUtils]: 55: Hoare triple {16666#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16666#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,019 INFO L290 TraceCheckUtils]: 56: Hoare triple {16666#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16667#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,019 INFO L290 TraceCheckUtils]: 57: Hoare triple {16667#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16667#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,020 INFO L290 TraceCheckUtils]: 58: Hoare triple {16667#(<= (+ main_~j~0 9) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16667#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,020 INFO L290 TraceCheckUtils]: 59: Hoare triple {16667#(<= (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16668#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,021 INFO L290 TraceCheckUtils]: 60: Hoare triple {16668#(<= (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16668#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,021 INFO L290 TraceCheckUtils]: 61: Hoare triple {16668#(<= (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16668#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,022 INFO L290 TraceCheckUtils]: 62: Hoare triple {16668#(<= (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16669#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,022 INFO L290 TraceCheckUtils]: 63: Hoare triple {16669#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16669#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,022 INFO L290 TraceCheckUtils]: 64: Hoare triple {16669#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16669#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,023 INFO L290 TraceCheckUtils]: 65: Hoare triple {16669#(<= (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16670#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,023 INFO L290 TraceCheckUtils]: 66: Hoare triple {16670#(<= (+ main_~j~0 6) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16670#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,024 INFO L290 TraceCheckUtils]: 67: Hoare triple {16670#(<= (+ main_~j~0 6) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16670#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,024 INFO L290 TraceCheckUtils]: 68: Hoare triple {16670#(<= (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16671#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:33,025 INFO L290 TraceCheckUtils]: 69: Hoare triple {16671#(<= (+ 5 main_~j~0) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {16651#false} is VALID [2022-04-08 03:35:33,025 INFO L290 TraceCheckUtils]: 70: Hoare triple {16651#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16651#false} is VALID [2022-04-08 03:35:33,025 INFO L290 TraceCheckUtils]: 71: Hoare triple {16651#false} assume !(~i~0 < ~nodecount~0); {16651#false} is VALID [2022-04-08 03:35:33,025 INFO L290 TraceCheckUtils]: 72: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-08 03:35:33,025 INFO L290 TraceCheckUtils]: 73: Hoare triple {16651#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16651#false} is VALID [2022-04-08 03:35:33,025 INFO L290 TraceCheckUtils]: 74: Hoare triple {16651#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {16651#false} is VALID [2022-04-08 03:35:33,025 INFO L290 TraceCheckUtils]: 75: Hoare triple {16651#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {16651#false} is VALID [2022-04-08 03:35:33,025 INFO L290 TraceCheckUtils]: 76: Hoare triple {16651#false} assume !(~i~0 < ~edgecount~0); {16651#false} is VALID [2022-04-08 03:35:33,025 INFO L290 TraceCheckUtils]: 77: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-08 03:35:33,026 INFO L290 TraceCheckUtils]: 78: Hoare triple {16651#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16651#false} is VALID [2022-04-08 03:35:33,026 INFO L272 TraceCheckUtils]: 79: Hoare triple {16651#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {16651#false} is VALID [2022-04-08 03:35:33,026 INFO L290 TraceCheckUtils]: 80: Hoare triple {16651#false} ~cond := #in~cond; {16651#false} is VALID [2022-04-08 03:35:33,026 INFO L290 TraceCheckUtils]: 81: Hoare triple {16651#false} assume 0 == ~cond; {16651#false} is VALID [2022-04-08 03:35:33,026 INFO L290 TraceCheckUtils]: 82: Hoare triple {16651#false} assume !false; {16651#false} is VALID [2022-04-08 03:35:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 330 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:33,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:33,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520082335] [2022-04-08 03:35:33,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520082335] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:33,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855805734] [2022-04-08 03:35:33,027 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:35:33,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:33,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:33,044 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:33,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-08 03:35:33,280 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 03:35:33,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:33,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 03:35:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:33,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:33,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {16650#true} call ULTIMATE.init(); {16650#true} is VALID [2022-04-08 03:35:33,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {16650#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {16650#true} is VALID [2022-04-08 03:35:33,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {16650#true} assume true; {16650#true} is VALID [2022-04-08 03:35:33,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16650#true} {16650#true} #107#return; {16650#true} is VALID [2022-04-08 03:35:33,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {16650#true} call #t~ret22 := main(); {16650#true} is VALID [2022-04-08 03:35:33,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {16650#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:33,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:33,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:33,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {16691#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:33,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:33,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:33,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {16691#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:33,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:33,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:33,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {16691#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:33,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:33,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:33,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {16691#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:33,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:33,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:33,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {16691#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:33,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:33,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {16691#(<= 5 main_~nodecount~0)} ~i~0 := 0; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,795 INFO L290 TraceCheckUtils]: 33: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,796 INFO L290 TraceCheckUtils]: 34: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,796 INFO L290 TraceCheckUtils]: 35: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,799 INFO L290 TraceCheckUtils]: 41: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,799 INFO L290 TraceCheckUtils]: 42: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,800 INFO L290 TraceCheckUtils]: 45: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,801 INFO L290 TraceCheckUtils]: 47: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,802 INFO L290 TraceCheckUtils]: 49: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,803 INFO L290 TraceCheckUtils]: 50: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,803 INFO L290 TraceCheckUtils]: 51: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,803 INFO L290 TraceCheckUtils]: 52: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,804 INFO L290 TraceCheckUtils]: 53: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,804 INFO L290 TraceCheckUtils]: 54: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,805 INFO L290 TraceCheckUtils]: 55: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,805 INFO L290 TraceCheckUtils]: 56: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,806 INFO L290 TraceCheckUtils]: 57: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,806 INFO L290 TraceCheckUtils]: 58: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,806 INFO L290 TraceCheckUtils]: 59: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,807 INFO L290 TraceCheckUtils]: 60: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,807 INFO L290 TraceCheckUtils]: 61: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,808 INFO L290 TraceCheckUtils]: 62: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,808 INFO L290 TraceCheckUtils]: 63: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,809 INFO L290 TraceCheckUtils]: 64: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,809 INFO L290 TraceCheckUtils]: 65: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,810 INFO L290 TraceCheckUtils]: 66: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,810 INFO L290 TraceCheckUtils]: 67: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,810 INFO L290 TraceCheckUtils]: 68: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,819 INFO L290 TraceCheckUtils]: 69: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,820 INFO L290 TraceCheckUtils]: 70: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16888#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:33,820 INFO L290 TraceCheckUtils]: 71: Hoare triple {16888#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {16651#false} is VALID [2022-04-08 03:35:33,820 INFO L290 TraceCheckUtils]: 72: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-08 03:35:33,820 INFO L290 TraceCheckUtils]: 73: Hoare triple {16651#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16651#false} is VALID [2022-04-08 03:35:33,821 INFO L290 TraceCheckUtils]: 74: Hoare triple {16651#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {16651#false} is VALID [2022-04-08 03:35:33,821 INFO L290 TraceCheckUtils]: 75: Hoare triple {16651#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {16651#false} is VALID [2022-04-08 03:35:33,821 INFO L290 TraceCheckUtils]: 76: Hoare triple {16651#false} assume !(~i~0 < ~edgecount~0); {16651#false} is VALID [2022-04-08 03:35:33,821 INFO L290 TraceCheckUtils]: 77: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-08 03:35:33,821 INFO L290 TraceCheckUtils]: 78: Hoare triple {16651#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16651#false} is VALID [2022-04-08 03:35:33,821 INFO L272 TraceCheckUtils]: 79: Hoare triple {16651#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {16651#false} is VALID [2022-04-08 03:35:33,821 INFO L290 TraceCheckUtils]: 80: Hoare triple {16651#false} ~cond := #in~cond; {16651#false} is VALID [2022-04-08 03:35:33,821 INFO L290 TraceCheckUtils]: 81: Hoare triple {16651#false} assume 0 == ~cond; {16651#false} is VALID [2022-04-08 03:35:33,821 INFO L290 TraceCheckUtils]: 82: Hoare triple {16651#false} assume !false; {16651#false} is VALID [2022-04-08 03:35:33,821 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-08 03:35:33,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:34,110 INFO L290 TraceCheckUtils]: 82: Hoare triple {16651#false} assume !false; {16651#false} is VALID [2022-04-08 03:35:34,110 INFO L290 TraceCheckUtils]: 81: Hoare triple {16651#false} assume 0 == ~cond; {16651#false} is VALID [2022-04-08 03:35:34,110 INFO L290 TraceCheckUtils]: 80: Hoare triple {16651#false} ~cond := #in~cond; {16651#false} is VALID [2022-04-08 03:35:34,110 INFO L272 TraceCheckUtils]: 79: Hoare triple {16651#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {16651#false} is VALID [2022-04-08 03:35:34,110 INFO L290 TraceCheckUtils]: 78: Hoare triple {16651#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16651#false} is VALID [2022-04-08 03:35:34,110 INFO L290 TraceCheckUtils]: 77: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-08 03:35:34,110 INFO L290 TraceCheckUtils]: 76: Hoare triple {16651#false} assume !(~i~0 < ~edgecount~0); {16651#false} is VALID [2022-04-08 03:35:34,111 INFO L290 TraceCheckUtils]: 75: Hoare triple {16651#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {16651#false} is VALID [2022-04-08 03:35:34,111 INFO L290 TraceCheckUtils]: 74: Hoare triple {16651#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {16651#false} is VALID [2022-04-08 03:35:34,111 INFO L290 TraceCheckUtils]: 73: Hoare triple {16651#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16651#false} is VALID [2022-04-08 03:35:34,111 INFO L290 TraceCheckUtils]: 72: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-08 03:35:34,111 INFO L290 TraceCheckUtils]: 71: Hoare triple {16958#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {16651#false} is VALID [2022-04-08 03:35:34,111 INFO L290 TraceCheckUtils]: 70: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16958#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-08 03:35:34,112 INFO L290 TraceCheckUtils]: 69: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,112 INFO L290 TraceCheckUtils]: 68: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,112 INFO L290 TraceCheckUtils]: 67: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,113 INFO L290 TraceCheckUtils]: 66: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,113 INFO L290 TraceCheckUtils]: 65: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,113 INFO L290 TraceCheckUtils]: 64: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,113 INFO L290 TraceCheckUtils]: 63: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,114 INFO L290 TraceCheckUtils]: 62: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,114 INFO L290 TraceCheckUtils]: 61: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,114 INFO L290 TraceCheckUtils]: 60: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,114 INFO L290 TraceCheckUtils]: 59: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,115 INFO L290 TraceCheckUtils]: 58: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,115 INFO L290 TraceCheckUtils]: 57: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,115 INFO L290 TraceCheckUtils]: 56: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,116 INFO L290 TraceCheckUtils]: 55: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,116 INFO L290 TraceCheckUtils]: 54: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,117 INFO L290 TraceCheckUtils]: 51: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,117 INFO L290 TraceCheckUtils]: 50: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,117 INFO L290 TraceCheckUtils]: 49: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,117 INFO L290 TraceCheckUtils]: 48: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,118 INFO L290 TraceCheckUtils]: 47: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,118 INFO L290 TraceCheckUtils]: 46: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,118 INFO L290 TraceCheckUtils]: 45: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,118 INFO L290 TraceCheckUtils]: 44: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,119 INFO L290 TraceCheckUtils]: 43: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,119 INFO L290 TraceCheckUtils]: 41: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,120 INFO L290 TraceCheckUtils]: 39: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,121 INFO L290 TraceCheckUtils]: 34: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,121 INFO L290 TraceCheckUtils]: 33: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {17107#(< 1 main_~nodecount~0)} ~i~0 := 0; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:35:34,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:34,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {17107#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:34,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:34,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:34,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {17107#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:34,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:34,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:34,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {17107#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:34,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:34,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:34,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {17107#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:34,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:34,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:34,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {17107#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:34,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {17107#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:34,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:34,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {16650#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-08 03:35:34,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {16650#true} call #t~ret22 := main(); {16650#true} is VALID [2022-04-08 03:35:34,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16650#true} {16650#true} #107#return; {16650#true} is VALID [2022-04-08 03:35:34,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {16650#true} assume true; {16650#true} is VALID [2022-04-08 03:35:34,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {16650#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {16650#true} is VALID [2022-04-08 03:35:34,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {16650#true} call ULTIMATE.init(); {16650#true} is VALID [2022-04-08 03:35:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-08 03:35:34,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855805734] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:34,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:34,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 5, 5] total 26 [2022-04-08 03:35:34,131 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:34,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [198587753] [2022-04-08 03:35:34,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [198587753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:34,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:34,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 03:35:34,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516650302] [2022-04-08 03:35:34,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:34,132 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-08 03:35:34,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:34,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:34,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:34,182 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 03:35:34,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:34,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 03:35:34,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2022-04-08 03:35:34,183 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:34,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:34,976 INFO L93 Difference]: Finished difference Result 157 states and 198 transitions. [2022-04-08 03:35:34,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 03:35:34,976 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-08 03:35:34,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:34,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 125 transitions. [2022-04-08 03:35:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:34,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 125 transitions. [2022-04-08 03:35:34,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 125 transitions. [2022-04-08 03:35:35,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:35,078 INFO L225 Difference]: With dead ends: 157 [2022-04-08 03:35:35,078 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 03:35:35,079 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=521, Invalid=1285, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 03:35:35,079 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 208 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:35,080 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 50 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 03:35:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-04-08 03:35:35,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:35,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 91 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:35,274 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 91 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:35,274 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 91 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:35,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:35,275 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-04-08 03:35:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2022-04-08 03:35:35,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:35,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:35,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 93 states. [2022-04-08 03:35:35,275 INFO L87 Difference]: Start difference. First operand has 91 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 93 states. [2022-04-08 03:35:35,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:35,277 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-04-08 03:35:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2022-04-08 03:35:35,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:35,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:35,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:35,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:35,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:35,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2022-04-08 03:35:35,278 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 83 [2022-04-08 03:35:35,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:35,278 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2022-04-08 03:35:35,279 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:35,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 112 transitions. [2022-04-08 03:35:35,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:35,444 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2022-04-08 03:35:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-08 03:35:35,444 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:35,445 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 16, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:35,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:35,645 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-08 03:35:35,645 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:35,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:35,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1423660838, now seen corresponding path program 37 times [2022-04-08 03:35:35,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:35,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1822498372] [2022-04-08 03:35:35,648 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:35,648 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:35,648 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:35,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1423660838, now seen corresponding path program 38 times [2022-04-08 03:35:35,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:35,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562707556] [2022-04-08 03:35:35,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:35,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:35,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:35,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {17915#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {17892#true} is VALID [2022-04-08 03:35:35,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-08 03:35:35,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17892#true} {17892#true} #107#return; {17892#true} is VALID [2022-04-08 03:35:35,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {17892#true} call ULTIMATE.init(); {17915#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:35,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {17915#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {17892#true} is VALID [2022-04-08 03:35:35,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-08 03:35:35,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17892#true} {17892#true} #107#return; {17892#true} is VALID [2022-04-08 03:35:35,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {17892#true} call #t~ret22 := main(); {17892#true} is VALID [2022-04-08 03:35:35,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {17892#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:35,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:35,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:35,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:35,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:35,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:35,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:35,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:35,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:35,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:35,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:35,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:35,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:35,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:35,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:35,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:35,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:35,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {17897#(<= 20 main_~edgecount~0)} ~i~0 := 0; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:35,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17898#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:35,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {17898#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17898#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:35,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {17898#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17898#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:35,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {17898#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17899#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {17899#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17899#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {17899#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17899#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {17899#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17900#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {17900#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17900#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {17900#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17900#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {17900#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,899 INFO L290 TraceCheckUtils]: 37: Hoare triple {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,901 INFO L290 TraceCheckUtils]: 40: Hoare triple {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,901 INFO L290 TraceCheckUtils]: 41: Hoare triple {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,901 INFO L290 TraceCheckUtils]: 42: Hoare triple {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,902 INFO L290 TraceCheckUtils]: 43: Hoare triple {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,902 INFO L290 TraceCheckUtils]: 44: Hoare triple {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,902 INFO L290 TraceCheckUtils]: 45: Hoare triple {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,903 INFO L290 TraceCheckUtils]: 46: Hoare triple {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,903 INFO L290 TraceCheckUtils]: 47: Hoare triple {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,903 INFO L290 TraceCheckUtils]: 48: Hoare triple {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,904 INFO L290 TraceCheckUtils]: 49: Hoare triple {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,904 INFO L290 TraceCheckUtils]: 50: Hoare triple {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,904 INFO L290 TraceCheckUtils]: 51: Hoare triple {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,905 INFO L290 TraceCheckUtils]: 52: Hoare triple {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,905 INFO L290 TraceCheckUtils]: 53: Hoare triple {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,905 INFO L290 TraceCheckUtils]: 54: Hoare triple {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,906 INFO L290 TraceCheckUtils]: 55: Hoare triple {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,906 INFO L290 TraceCheckUtils]: 56: Hoare triple {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,906 INFO L290 TraceCheckUtils]: 57: Hoare triple {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,907 INFO L290 TraceCheckUtils]: 58: Hoare triple {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,907 INFO L290 TraceCheckUtils]: 59: Hoare triple {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,908 INFO L290 TraceCheckUtils]: 60: Hoare triple {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,908 INFO L290 TraceCheckUtils]: 61: Hoare triple {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,908 INFO L290 TraceCheckUtils]: 62: Hoare triple {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,909 INFO L290 TraceCheckUtils]: 63: Hoare triple {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,909 INFO L290 TraceCheckUtils]: 64: Hoare triple {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,909 INFO L290 TraceCheckUtils]: 65: Hoare triple {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,910 INFO L290 TraceCheckUtils]: 66: Hoare triple {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,910 INFO L290 TraceCheckUtils]: 67: Hoare triple {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,910 INFO L290 TraceCheckUtils]: 68: Hoare triple {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,911 INFO L290 TraceCheckUtils]: 69: Hoare triple {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,911 INFO L290 TraceCheckUtils]: 70: Hoare triple {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,911 INFO L290 TraceCheckUtils]: 71: Hoare triple {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:35,912 INFO L290 TraceCheckUtils]: 72: Hoare triple {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {17893#false} is VALID [2022-04-08 03:35:35,912 INFO L290 TraceCheckUtils]: 73: Hoare triple {17893#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17893#false} is VALID [2022-04-08 03:35:35,912 INFO L290 TraceCheckUtils]: 74: Hoare triple {17893#false} assume !(~i~0 < ~nodecount~0); {17893#false} is VALID [2022-04-08 03:35:35,912 INFO L290 TraceCheckUtils]: 75: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-08 03:35:35,912 INFO L290 TraceCheckUtils]: 76: Hoare triple {17893#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {17893#false} is VALID [2022-04-08 03:35:35,912 INFO L290 TraceCheckUtils]: 77: Hoare triple {17893#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17893#false} is VALID [2022-04-08 03:35:35,912 INFO L290 TraceCheckUtils]: 78: Hoare triple {17893#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17893#false} is VALID [2022-04-08 03:35:35,912 INFO L290 TraceCheckUtils]: 79: Hoare triple {17893#false} assume !(~i~0 < ~edgecount~0); {17893#false} is VALID [2022-04-08 03:35:35,912 INFO L290 TraceCheckUtils]: 80: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-08 03:35:35,912 INFO L290 TraceCheckUtils]: 81: Hoare triple {17893#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17893#false} is VALID [2022-04-08 03:35:35,912 INFO L272 TraceCheckUtils]: 82: Hoare triple {17893#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {17893#false} is VALID [2022-04-08 03:35:35,912 INFO L290 TraceCheckUtils]: 83: Hoare triple {17893#false} ~cond := #in~cond; {17893#false} is VALID [2022-04-08 03:35:35,912 INFO L290 TraceCheckUtils]: 84: Hoare triple {17893#false} assume 0 == ~cond; {17893#false} is VALID [2022-04-08 03:35:35,912 INFO L290 TraceCheckUtils]: 85: Hoare triple {17893#false} assume !false; {17893#false} is VALID [2022-04-08 03:35:35,913 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 1 proven. 376 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:35,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:35,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562707556] [2022-04-08 03:35:35,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562707556] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:35,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890321165] [2022-04-08 03:35:35,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:35,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:35,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:35,914 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:35,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-08 03:35:36,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:36,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:36,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 03:35:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:36,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:36,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {17892#true} call ULTIMATE.init(); {17892#true} is VALID [2022-04-08 03:35:36,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {17892#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {17892#true} is VALID [2022-04-08 03:35:36,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-08 03:35:36,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17892#true} {17892#true} #107#return; {17892#true} is VALID [2022-04-08 03:35:36,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {17892#true} call #t~ret22 := main(); {17892#true} is VALID [2022-04-08 03:35:36,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {17892#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:36,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:36,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:36,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:36,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:36,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:36,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:36,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:36,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:36,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:36,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:36,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:36,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:36,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:36,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:36,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:36,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:36,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {17897#(<= 20 main_~edgecount~0)} ~i~0 := 0; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:36,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17988#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 03:35:36,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {17988#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17988#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 03:35:36,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {17988#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17988#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 03:35:36,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {17988#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17998#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:36,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {17998#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17998#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:36,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {17998#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17998#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:36,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {17998#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18008#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {18008#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18008#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {18008#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18008#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {18008#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18018#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:36,802 INFO L290 TraceCheckUtils]: 33: Hoare triple {18018#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18018#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:36,802 INFO L290 TraceCheckUtils]: 34: Hoare triple {18018#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18018#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:36,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {18018#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18028#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:36,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {18028#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18028#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:36,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {18028#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18028#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:36,804 INFO L290 TraceCheckUtils]: 38: Hoare triple {18028#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18038#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:36,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {18038#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18038#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:36,805 INFO L290 TraceCheckUtils]: 40: Hoare triple {18038#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18038#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:36,805 INFO L290 TraceCheckUtils]: 41: Hoare triple {18038#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18048#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,806 INFO L290 TraceCheckUtils]: 42: Hoare triple {18048#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18048#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,806 INFO L290 TraceCheckUtils]: 43: Hoare triple {18048#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18048#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,807 INFO L290 TraceCheckUtils]: 44: Hoare triple {18048#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18058#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,807 INFO L290 TraceCheckUtils]: 45: Hoare triple {18058#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18058#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,808 INFO L290 TraceCheckUtils]: 46: Hoare triple {18058#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18058#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,808 INFO L290 TraceCheckUtils]: 47: Hoare triple {18058#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18068#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,808 INFO L290 TraceCheckUtils]: 48: Hoare triple {18068#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18068#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {18068#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18068#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,809 INFO L290 TraceCheckUtils]: 50: Hoare triple {18068#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18078#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:36,810 INFO L290 TraceCheckUtils]: 51: Hoare triple {18078#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18078#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:36,810 INFO L290 TraceCheckUtils]: 52: Hoare triple {18078#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18078#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:36,810 INFO L290 TraceCheckUtils]: 53: Hoare triple {18078#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18088#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,811 INFO L290 TraceCheckUtils]: 54: Hoare triple {18088#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18088#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,811 INFO L290 TraceCheckUtils]: 55: Hoare triple {18088#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18088#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,812 INFO L290 TraceCheckUtils]: 56: Hoare triple {18088#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18098#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,812 INFO L290 TraceCheckUtils]: 57: Hoare triple {18098#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18098#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,812 INFO L290 TraceCheckUtils]: 58: Hoare triple {18098#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18098#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,813 INFO L290 TraceCheckUtils]: 59: Hoare triple {18098#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18108#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,813 INFO L290 TraceCheckUtils]: 60: Hoare triple {18108#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18108#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,814 INFO L290 TraceCheckUtils]: 61: Hoare triple {18108#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18108#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,814 INFO L290 TraceCheckUtils]: 62: Hoare triple {18108#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18118#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,814 INFO L290 TraceCheckUtils]: 63: Hoare triple {18118#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18118#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,815 INFO L290 TraceCheckUtils]: 64: Hoare triple {18118#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18118#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,815 INFO L290 TraceCheckUtils]: 65: Hoare triple {18118#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18128#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,816 INFO L290 TraceCheckUtils]: 66: Hoare triple {18128#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18128#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,816 INFO L290 TraceCheckUtils]: 67: Hoare triple {18128#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18128#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,817 INFO L290 TraceCheckUtils]: 68: Hoare triple {18128#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18138#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,817 INFO L290 TraceCheckUtils]: 69: Hoare triple {18138#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18138#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,817 INFO L290 TraceCheckUtils]: 70: Hoare triple {18138#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18138#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:36,818 INFO L290 TraceCheckUtils]: 71: Hoare triple {18138#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18148#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} is VALID [2022-04-08 03:35:36,818 INFO L290 TraceCheckUtils]: 72: Hoare triple {18148#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} assume !(~j~0 < ~edgecount~0); {17893#false} is VALID [2022-04-08 03:35:36,818 INFO L290 TraceCheckUtils]: 73: Hoare triple {17893#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17893#false} is VALID [2022-04-08 03:35:36,818 INFO L290 TraceCheckUtils]: 74: Hoare triple {17893#false} assume !(~i~0 < ~nodecount~0); {17893#false} is VALID [2022-04-08 03:35:36,818 INFO L290 TraceCheckUtils]: 75: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-08 03:35:36,818 INFO L290 TraceCheckUtils]: 76: Hoare triple {17893#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {17893#false} is VALID [2022-04-08 03:35:36,818 INFO L290 TraceCheckUtils]: 77: Hoare triple {17893#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17893#false} is VALID [2022-04-08 03:35:36,818 INFO L290 TraceCheckUtils]: 78: Hoare triple {17893#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17893#false} is VALID [2022-04-08 03:35:36,818 INFO L290 TraceCheckUtils]: 79: Hoare triple {17893#false} assume !(~i~0 < ~edgecount~0); {17893#false} is VALID [2022-04-08 03:35:36,819 INFO L290 TraceCheckUtils]: 80: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-08 03:35:36,819 INFO L290 TraceCheckUtils]: 81: Hoare triple {17893#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17893#false} is VALID [2022-04-08 03:35:36,819 INFO L272 TraceCheckUtils]: 82: Hoare triple {17893#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {17893#false} is VALID [2022-04-08 03:35:36,819 INFO L290 TraceCheckUtils]: 83: Hoare triple {17893#false} ~cond := #in~cond; {17893#false} is VALID [2022-04-08 03:35:36,819 INFO L290 TraceCheckUtils]: 84: Hoare triple {17893#false} assume 0 == ~cond; {17893#false} is VALID [2022-04-08 03:35:36,819 INFO L290 TraceCheckUtils]: 85: Hoare triple {17893#false} assume !false; {17893#false} is VALID [2022-04-08 03:35:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 1 proven. 376 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:36,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:37,227 INFO L290 TraceCheckUtils]: 85: Hoare triple {17893#false} assume !false; {17893#false} is VALID [2022-04-08 03:35:37,227 INFO L290 TraceCheckUtils]: 84: Hoare triple {17893#false} assume 0 == ~cond; {17893#false} is VALID [2022-04-08 03:35:37,227 INFO L290 TraceCheckUtils]: 83: Hoare triple {17893#false} ~cond := #in~cond; {17893#false} is VALID [2022-04-08 03:35:37,227 INFO L272 TraceCheckUtils]: 82: Hoare triple {17893#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {17893#false} is VALID [2022-04-08 03:35:37,227 INFO L290 TraceCheckUtils]: 81: Hoare triple {17893#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17893#false} is VALID [2022-04-08 03:35:37,227 INFO L290 TraceCheckUtils]: 80: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-08 03:35:37,227 INFO L290 TraceCheckUtils]: 79: Hoare triple {17893#false} assume !(~i~0 < ~edgecount~0); {17893#false} is VALID [2022-04-08 03:35:37,227 INFO L290 TraceCheckUtils]: 78: Hoare triple {17893#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17893#false} is VALID [2022-04-08 03:35:37,227 INFO L290 TraceCheckUtils]: 77: Hoare triple {17893#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17893#false} is VALID [2022-04-08 03:35:37,227 INFO L290 TraceCheckUtils]: 76: Hoare triple {17893#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {17893#false} is VALID [2022-04-08 03:35:37,227 INFO L290 TraceCheckUtils]: 75: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-08 03:35:37,227 INFO L290 TraceCheckUtils]: 74: Hoare triple {17893#false} assume !(~i~0 < ~nodecount~0); {17893#false} is VALID [2022-04-08 03:35:37,228 INFO L290 TraceCheckUtils]: 73: Hoare triple {17893#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17893#false} is VALID [2022-04-08 03:35:37,228 INFO L290 TraceCheckUtils]: 72: Hoare triple {18230#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {17893#false} is VALID [2022-04-08 03:35:37,228 INFO L290 TraceCheckUtils]: 71: Hoare triple {18234#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18230#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,228 INFO L290 TraceCheckUtils]: 70: Hoare triple {18234#(< (+ main_~j~0 1) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18234#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,229 INFO L290 TraceCheckUtils]: 69: Hoare triple {18234#(< (+ main_~j~0 1) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18234#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,229 INFO L290 TraceCheckUtils]: 68: Hoare triple {18244#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18234#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,229 INFO L290 TraceCheckUtils]: 67: Hoare triple {18244#(< (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18244#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,230 INFO L290 TraceCheckUtils]: 66: Hoare triple {18244#(< (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18244#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,230 INFO L290 TraceCheckUtils]: 65: Hoare triple {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18244#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,230 INFO L290 TraceCheckUtils]: 64: Hoare triple {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,231 INFO L290 TraceCheckUtils]: 63: Hoare triple {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,231 INFO L290 TraceCheckUtils]: 62: Hoare triple {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,231 INFO L290 TraceCheckUtils]: 61: Hoare triple {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,232 INFO L290 TraceCheckUtils]: 60: Hoare triple {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,232 INFO L290 TraceCheckUtils]: 59: Hoare triple {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,233 INFO L290 TraceCheckUtils]: 57: Hoare triple {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,233 INFO L290 TraceCheckUtils]: 56: Hoare triple {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,233 INFO L290 TraceCheckUtils]: 55: Hoare triple {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,234 INFO L290 TraceCheckUtils]: 53: Hoare triple {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,234 INFO L290 TraceCheckUtils]: 52: Hoare triple {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,234 INFO L290 TraceCheckUtils]: 51: Hoare triple {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,235 INFO L290 TraceCheckUtils]: 50: Hoare triple {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,235 INFO L290 TraceCheckUtils]: 49: Hoare triple {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,235 INFO L290 TraceCheckUtils]: 48: Hoare triple {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,236 INFO L290 TraceCheckUtils]: 47: Hoare triple {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,236 INFO L290 TraceCheckUtils]: 46: Hoare triple {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,236 INFO L290 TraceCheckUtils]: 45: Hoare triple {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,237 INFO L290 TraceCheckUtils]: 44: Hoare triple {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,237 INFO L290 TraceCheckUtils]: 43: Hoare triple {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,239 INFO L290 TraceCheckUtils]: 37: Hoare triple {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,240 INFO L290 TraceCheckUtils]: 34: Hoare triple {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,240 INFO L290 TraceCheckUtils]: 33: Hoare triple {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,240 INFO L290 TraceCheckUtils]: 32: Hoare triple {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,241 INFO L290 TraceCheckUtils]: 31: Hoare triple {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:37,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {18380#(<= 17 main_~edgecount~0)} ~i~0 := 0; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {18380#(<= 17 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {18380#(<= 17 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {18380#(<= 17 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {18380#(<= 17 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {18380#(<= 17 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {17892#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-08 03:35:37,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {17892#true} call #t~ret22 := main(); {17892#true} is VALID [2022-04-08 03:35:37,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17892#true} {17892#true} #107#return; {17892#true} is VALID [2022-04-08 03:35:37,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-08 03:35:37,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {17892#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {17892#true} is VALID [2022-04-08 03:35:37,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {17892#true} call ULTIMATE.init(); {17892#true} is VALID [2022-04-08 03:35:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 1 proven. 376 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:37,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890321165] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:37,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:37,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 42 [2022-04-08 03:35:37,250 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:37,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1822498372] [2022-04-08 03:35:37,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1822498372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:37,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:37,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 03:35:37,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114669558] [2022-04-08 03:35:37,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:37,251 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-08 03:35:37,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:37,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:37,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:37,309 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 03:35:37,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:37,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 03:35:37,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=1058, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 03:35:37,311 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:38,064 INFO L93 Difference]: Finished difference Result 163 states and 206 transitions. [2022-04-08 03:35:38,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 03:35:38,064 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-08 03:35:38,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:38,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 129 transitions. [2022-04-08 03:35:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 129 transitions. [2022-04-08 03:35:38,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 129 transitions. [2022-04-08 03:35:38,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:38,176 INFO L225 Difference]: With dead ends: 163 [2022-04-08 03:35:38,176 INFO L226 Difference]: Without dead ends: 96 [2022-04-08 03:35:38,177 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=2412, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 03:35:38,177 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 233 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:38,178 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 40 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-08 03:35:38,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-04-08 03:35:38,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:38,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 94 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:38,374 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 94 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:38,374 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 94 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:38,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:38,375 INFO L93 Difference]: Finished difference Result 96 states and 119 transitions. [2022-04-08 03:35:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2022-04-08 03:35:38,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:38,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:38,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 96 states. [2022-04-08 03:35:38,375 INFO L87 Difference]: Start difference. First operand has 94 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 96 states. [2022-04-08 03:35:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:38,376 INFO L93 Difference]: Finished difference Result 96 states and 119 transitions. [2022-04-08 03:35:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2022-04-08 03:35:38,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:38,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:38,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:38,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:38,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-08 03:35:38,378 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 86 [2022-04-08 03:35:38,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:38,378 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-08 03:35:38,378 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:38,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 116 transitions. [2022-04-08 03:35:38,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-08 03:35:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 03:35:38,566 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:38,566 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 17, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:38,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-08 03:35:38,767 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-08 03:35:38,767 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:38,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:38,767 INFO L85 PathProgramCache]: Analyzing trace with hash 590969713, now seen corresponding path program 39 times [2022-04-08 03:35:38,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:38,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1864357977] [2022-04-08 03:35:38,770 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:38,770 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:38,770 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash 590969713, now seen corresponding path program 40 times [2022-04-08 03:35:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:38,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952092303] [2022-04-08 03:35:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:39,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:39,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {19218#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {19194#true} is VALID [2022-04-08 03:35:39,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {19194#true} assume true; {19194#true} is VALID [2022-04-08 03:35:39,076 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19194#true} {19194#true} #107#return; {19194#true} is VALID [2022-04-08 03:35:39,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {19194#true} call ULTIMATE.init(); {19218#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:39,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {19218#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {19194#true} is VALID [2022-04-08 03:35:39,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {19194#true} assume true; {19194#true} is VALID [2022-04-08 03:35:39,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19194#true} {19194#true} #107#return; {19194#true} is VALID [2022-04-08 03:35:39,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {19194#true} call #t~ret22 := main(); {19194#true} is VALID [2022-04-08 03:35:39,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {19194#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:39,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:39,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:39,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:39,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:39,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:39,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:39,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:39,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:39,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:39,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:39,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:39,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:39,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:39,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:39,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:39,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:39,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:39,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {19200#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {19200#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19200#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {19200#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19200#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {19200#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19201#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:39,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {19201#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19201#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:39,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {19201#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19201#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:39,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {19201#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19202#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {19202#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19202#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {19202#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19202#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {19202#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19203#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:39,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {19203#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19203#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:39,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {19203#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19203#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:39,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {19203#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19204#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:39,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {19204#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19204#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:39,090 INFO L290 TraceCheckUtils]: 37: Hoare triple {19204#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19204#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:39,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {19204#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19205#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:39,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {19205#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19205#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:39,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {19205#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19205#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:39,091 INFO L290 TraceCheckUtils]: 41: Hoare triple {19205#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19206#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,092 INFO L290 TraceCheckUtils]: 42: Hoare triple {19206#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19206#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,092 INFO L290 TraceCheckUtils]: 43: Hoare triple {19206#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19206#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,093 INFO L290 TraceCheckUtils]: 44: Hoare triple {19206#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19207#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,093 INFO L290 TraceCheckUtils]: 45: Hoare triple {19207#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19207#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,093 INFO L290 TraceCheckUtils]: 46: Hoare triple {19207#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19207#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,094 INFO L290 TraceCheckUtils]: 47: Hoare triple {19207#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19208#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,094 INFO L290 TraceCheckUtils]: 48: Hoare triple {19208#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19208#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,095 INFO L290 TraceCheckUtils]: 49: Hoare triple {19208#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19208#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,095 INFO L290 TraceCheckUtils]: 50: Hoare triple {19208#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19209#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:39,095 INFO L290 TraceCheckUtils]: 51: Hoare triple {19209#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19209#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:39,096 INFO L290 TraceCheckUtils]: 52: Hoare triple {19209#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19209#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:39,096 INFO L290 TraceCheckUtils]: 53: Hoare triple {19209#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19210#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,097 INFO L290 TraceCheckUtils]: 54: Hoare triple {19210#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19210#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,097 INFO L290 TraceCheckUtils]: 55: Hoare triple {19210#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19210#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,097 INFO L290 TraceCheckUtils]: 56: Hoare triple {19210#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19211#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,098 INFO L290 TraceCheckUtils]: 57: Hoare triple {19211#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19211#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,098 INFO L290 TraceCheckUtils]: 58: Hoare triple {19211#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19211#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,099 INFO L290 TraceCheckUtils]: 59: Hoare triple {19211#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19212#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,099 INFO L290 TraceCheckUtils]: 60: Hoare triple {19212#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19212#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,099 INFO L290 TraceCheckUtils]: 61: Hoare triple {19212#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19212#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,100 INFO L290 TraceCheckUtils]: 62: Hoare triple {19212#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19213#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,100 INFO L290 TraceCheckUtils]: 63: Hoare triple {19213#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19213#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,101 INFO L290 TraceCheckUtils]: 64: Hoare triple {19213#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19213#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,101 INFO L290 TraceCheckUtils]: 65: Hoare triple {19213#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19214#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,102 INFO L290 TraceCheckUtils]: 66: Hoare triple {19214#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19214#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,102 INFO L290 TraceCheckUtils]: 67: Hoare triple {19214#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19214#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,103 INFO L290 TraceCheckUtils]: 68: Hoare triple {19214#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19215#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,103 INFO L290 TraceCheckUtils]: 69: Hoare triple {19215#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19215#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,104 INFO L290 TraceCheckUtils]: 70: Hoare triple {19215#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19215#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:39,104 INFO L290 TraceCheckUtils]: 71: Hoare triple {19215#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19216#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-08 03:35:39,105 INFO L290 TraceCheckUtils]: 72: Hoare triple {19216#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19216#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-08 03:35:39,105 INFO L290 TraceCheckUtils]: 73: Hoare triple {19216#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19216#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-08 03:35:39,106 INFO L290 TraceCheckUtils]: 74: Hoare triple {19216#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19217#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-08 03:35:39,106 INFO L290 TraceCheckUtils]: 75: Hoare triple {19217#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} assume !(~j~0 < ~edgecount~0); {19195#false} is VALID [2022-04-08 03:35:39,106 INFO L290 TraceCheckUtils]: 76: Hoare triple {19195#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19195#false} is VALID [2022-04-08 03:35:39,106 INFO L290 TraceCheckUtils]: 77: Hoare triple {19195#false} assume !(~i~0 < ~nodecount~0); {19195#false} is VALID [2022-04-08 03:35:39,106 INFO L290 TraceCheckUtils]: 78: Hoare triple {19195#false} ~i~0 := 0; {19195#false} is VALID [2022-04-08 03:35:39,106 INFO L290 TraceCheckUtils]: 79: Hoare triple {19195#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {19195#false} is VALID [2022-04-08 03:35:39,106 INFO L290 TraceCheckUtils]: 80: Hoare triple {19195#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {19195#false} is VALID [2022-04-08 03:35:39,107 INFO L290 TraceCheckUtils]: 81: Hoare triple {19195#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {19195#false} is VALID [2022-04-08 03:35:39,107 INFO L290 TraceCheckUtils]: 82: Hoare triple {19195#false} assume !(~i~0 < ~edgecount~0); {19195#false} is VALID [2022-04-08 03:35:39,107 INFO L290 TraceCheckUtils]: 83: Hoare triple {19195#false} ~i~0 := 0; {19195#false} is VALID [2022-04-08 03:35:39,107 INFO L290 TraceCheckUtils]: 84: Hoare triple {19195#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19195#false} is VALID [2022-04-08 03:35:39,107 INFO L272 TraceCheckUtils]: 85: Hoare triple {19195#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {19195#false} is VALID [2022-04-08 03:35:39,107 INFO L290 TraceCheckUtils]: 86: Hoare triple {19195#false} ~cond := #in~cond; {19195#false} is VALID [2022-04-08 03:35:39,107 INFO L290 TraceCheckUtils]: 87: Hoare triple {19195#false} assume 0 == ~cond; {19195#false} is VALID [2022-04-08 03:35:39,107 INFO L290 TraceCheckUtils]: 88: Hoare triple {19195#false} assume !false; {19195#false} is VALID [2022-04-08 03:35:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 1 proven. 425 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:39,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:39,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952092303] [2022-04-08 03:35:39,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952092303] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:39,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872677371] [2022-04-08 03:35:39,108 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:35:39,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:39,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:39,109 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:39,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-08 03:35:39,269 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:35:39,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:39,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 03:35:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:39,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:39,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {19194#true} call ULTIMATE.init(); {19194#true} is VALID [2022-04-08 03:35:39,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {19194#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {19194#true} is VALID [2022-04-08 03:35:39,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {19194#true} assume true; {19194#true} is VALID [2022-04-08 03:35:39,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19194#true} {19194#true} #107#return; {19194#true} is VALID [2022-04-08 03:35:39,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {19194#true} call #t~ret22 := main(); {19194#true} is VALID [2022-04-08 03:35:39,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {19194#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {19194#true} is VALID [2022-04-08 03:35:39,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 03:35:39,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {19194#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 03:35:39,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 03:35:39,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 03:35:39,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 03:35:39,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 03:35:39,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 03:35:39,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 03:35:39,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 03:35:39,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 03:35:39,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 03:35:39,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 03:35:39,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 03:35:39,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 03:35:39,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 03:35:39,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {19194#true} assume !(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 03:35:39,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {19194#true} ~i~0 := 0; {19194#true} is VALID [2022-04-08 03:35:39,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {19291#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:39,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {19291#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19291#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:39,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {19291#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19291#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:39,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {19291#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19301#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:39,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {19301#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19301#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:39,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {19301#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19301#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:39,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {19301#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19311#(<= 2 main_~j~0)} is VALID [2022-04-08 03:35:39,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {19311#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19311#(<= 2 main_~j~0)} is VALID [2022-04-08 03:35:39,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {19311#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19311#(<= 2 main_~j~0)} is VALID [2022-04-08 03:35:39,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {19311#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19321#(<= 3 main_~j~0)} is VALID [2022-04-08 03:35:39,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {19321#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19321#(<= 3 main_~j~0)} is VALID [2022-04-08 03:35:39,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {19321#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19321#(<= 3 main_~j~0)} is VALID [2022-04-08 03:35:39,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {19321#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19331#(<= 4 main_~j~0)} is VALID [2022-04-08 03:35:39,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {19331#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19331#(<= 4 main_~j~0)} is VALID [2022-04-08 03:35:39,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {19331#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19331#(<= 4 main_~j~0)} is VALID [2022-04-08 03:35:39,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {19331#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19341#(<= 5 main_~j~0)} is VALID [2022-04-08 03:35:39,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {19341#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19341#(<= 5 main_~j~0)} is VALID [2022-04-08 03:35:39,769 INFO L290 TraceCheckUtils]: 40: Hoare triple {19341#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19341#(<= 5 main_~j~0)} is VALID [2022-04-08 03:35:39,769 INFO L290 TraceCheckUtils]: 41: Hoare triple {19341#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19351#(<= 6 main_~j~0)} is VALID [2022-04-08 03:35:39,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {19351#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19351#(<= 6 main_~j~0)} is VALID [2022-04-08 03:35:39,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {19351#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19351#(<= 6 main_~j~0)} is VALID [2022-04-08 03:35:39,770 INFO L290 TraceCheckUtils]: 44: Hoare triple {19351#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19361#(<= 7 main_~j~0)} is VALID [2022-04-08 03:35:39,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {19361#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19361#(<= 7 main_~j~0)} is VALID [2022-04-08 03:35:39,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {19361#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19361#(<= 7 main_~j~0)} is VALID [2022-04-08 03:35:39,771 INFO L290 TraceCheckUtils]: 47: Hoare triple {19361#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19371#(<= 8 main_~j~0)} is VALID [2022-04-08 03:35:39,771 INFO L290 TraceCheckUtils]: 48: Hoare triple {19371#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19371#(<= 8 main_~j~0)} is VALID [2022-04-08 03:35:39,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {19371#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19371#(<= 8 main_~j~0)} is VALID [2022-04-08 03:35:39,771 INFO L290 TraceCheckUtils]: 50: Hoare triple {19371#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19381#(<= 9 main_~j~0)} is VALID [2022-04-08 03:35:39,772 INFO L290 TraceCheckUtils]: 51: Hoare triple {19381#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19381#(<= 9 main_~j~0)} is VALID [2022-04-08 03:35:39,772 INFO L290 TraceCheckUtils]: 52: Hoare triple {19381#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19381#(<= 9 main_~j~0)} is VALID [2022-04-08 03:35:39,772 INFO L290 TraceCheckUtils]: 53: Hoare triple {19381#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19391#(<= 10 main_~j~0)} is VALID [2022-04-08 03:35:39,772 INFO L290 TraceCheckUtils]: 54: Hoare triple {19391#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19391#(<= 10 main_~j~0)} is VALID [2022-04-08 03:35:39,773 INFO L290 TraceCheckUtils]: 55: Hoare triple {19391#(<= 10 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19391#(<= 10 main_~j~0)} is VALID [2022-04-08 03:35:39,773 INFO L290 TraceCheckUtils]: 56: Hoare triple {19391#(<= 10 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19401#(<= 11 main_~j~0)} is VALID [2022-04-08 03:35:39,773 INFO L290 TraceCheckUtils]: 57: Hoare triple {19401#(<= 11 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19401#(<= 11 main_~j~0)} is VALID [2022-04-08 03:35:39,773 INFO L290 TraceCheckUtils]: 58: Hoare triple {19401#(<= 11 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19401#(<= 11 main_~j~0)} is VALID [2022-04-08 03:35:39,774 INFO L290 TraceCheckUtils]: 59: Hoare triple {19401#(<= 11 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19411#(<= 12 main_~j~0)} is VALID [2022-04-08 03:35:39,774 INFO L290 TraceCheckUtils]: 60: Hoare triple {19411#(<= 12 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19411#(<= 12 main_~j~0)} is VALID [2022-04-08 03:35:39,774 INFO L290 TraceCheckUtils]: 61: Hoare triple {19411#(<= 12 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19411#(<= 12 main_~j~0)} is VALID [2022-04-08 03:35:39,775 INFO L290 TraceCheckUtils]: 62: Hoare triple {19411#(<= 12 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19421#(<= 13 main_~j~0)} is VALID [2022-04-08 03:35:39,775 INFO L290 TraceCheckUtils]: 63: Hoare triple {19421#(<= 13 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19421#(<= 13 main_~j~0)} is VALID [2022-04-08 03:35:39,775 INFO L290 TraceCheckUtils]: 64: Hoare triple {19421#(<= 13 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19421#(<= 13 main_~j~0)} is VALID [2022-04-08 03:35:39,775 INFO L290 TraceCheckUtils]: 65: Hoare triple {19421#(<= 13 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19431#(<= 14 main_~j~0)} is VALID [2022-04-08 03:35:39,776 INFO L290 TraceCheckUtils]: 66: Hoare triple {19431#(<= 14 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19431#(<= 14 main_~j~0)} is VALID [2022-04-08 03:35:39,776 INFO L290 TraceCheckUtils]: 67: Hoare triple {19431#(<= 14 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19431#(<= 14 main_~j~0)} is VALID [2022-04-08 03:35:39,776 INFO L290 TraceCheckUtils]: 68: Hoare triple {19431#(<= 14 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19441#(<= 15 main_~j~0)} is VALID [2022-04-08 03:35:39,776 INFO L290 TraceCheckUtils]: 69: Hoare triple {19441#(<= 15 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19441#(<= 15 main_~j~0)} is VALID [2022-04-08 03:35:39,777 INFO L290 TraceCheckUtils]: 70: Hoare triple {19441#(<= 15 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19441#(<= 15 main_~j~0)} is VALID [2022-04-08 03:35:39,777 INFO L290 TraceCheckUtils]: 71: Hoare triple {19441#(<= 15 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19451#(<= 16 main_~j~0)} is VALID [2022-04-08 03:35:39,784 INFO L290 TraceCheckUtils]: 72: Hoare triple {19451#(<= 16 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19455#(< 16 main_~edgecount~0)} is VALID [2022-04-08 03:35:39,785 INFO L290 TraceCheckUtils]: 73: Hoare triple {19455#(< 16 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19455#(< 16 main_~edgecount~0)} is VALID [2022-04-08 03:35:39,785 INFO L290 TraceCheckUtils]: 74: Hoare triple {19455#(< 16 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19455#(< 16 main_~edgecount~0)} is VALID [2022-04-08 03:35:39,785 INFO L290 TraceCheckUtils]: 75: Hoare triple {19455#(< 16 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {19455#(< 16 main_~edgecount~0)} is VALID [2022-04-08 03:35:39,785 INFO L290 TraceCheckUtils]: 76: Hoare triple {19455#(< 16 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19455#(< 16 main_~edgecount~0)} is VALID [2022-04-08 03:35:39,786 INFO L290 TraceCheckUtils]: 77: Hoare triple {19455#(< 16 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {19455#(< 16 main_~edgecount~0)} is VALID [2022-04-08 03:35:39,786 INFO L290 TraceCheckUtils]: 78: Hoare triple {19455#(< 16 main_~edgecount~0)} ~i~0 := 0; {19474#(and (< 16 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-08 03:35:39,786 INFO L290 TraceCheckUtils]: 79: Hoare triple {19474#(and (< 16 main_~edgecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {19474#(and (< 16 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-08 03:35:39,787 INFO L290 TraceCheckUtils]: 80: Hoare triple {19474#(and (< 16 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {19474#(and (< 16 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-08 03:35:39,787 INFO L290 TraceCheckUtils]: 81: Hoare triple {19474#(and (< 16 main_~edgecount~0) (<= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {19484#(and (< 16 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 03:35:39,787 INFO L290 TraceCheckUtils]: 82: Hoare triple {19484#(and (< 16 main_~edgecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~edgecount~0); {19195#false} is VALID [2022-04-08 03:35:39,787 INFO L290 TraceCheckUtils]: 83: Hoare triple {19195#false} ~i~0 := 0; {19195#false} is VALID [2022-04-08 03:35:39,788 INFO L290 TraceCheckUtils]: 84: Hoare triple {19195#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19195#false} is VALID [2022-04-08 03:35:39,788 INFO L272 TraceCheckUtils]: 85: Hoare triple {19195#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {19195#false} is VALID [2022-04-08 03:35:39,788 INFO L290 TraceCheckUtils]: 86: Hoare triple {19195#false} ~cond := #in~cond; {19195#false} is VALID [2022-04-08 03:35:39,788 INFO L290 TraceCheckUtils]: 87: Hoare triple {19195#false} assume 0 == ~cond; {19195#false} is VALID [2022-04-08 03:35:39,788 INFO L290 TraceCheckUtils]: 88: Hoare triple {19195#false} assume !false; {19195#false} is VALID [2022-04-08 03:35:39,788 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 377 proven. 50 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 03:35:39,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:40,269 INFO L290 TraceCheckUtils]: 88: Hoare triple {19195#false} assume !false; {19195#false} is VALID [2022-04-08 03:35:40,270 INFO L290 TraceCheckUtils]: 87: Hoare triple {19195#false} assume 0 == ~cond; {19195#false} is VALID [2022-04-08 03:35:40,270 INFO L290 TraceCheckUtils]: 86: Hoare triple {19195#false} ~cond := #in~cond; {19195#false} is VALID [2022-04-08 03:35:40,270 INFO L272 TraceCheckUtils]: 85: Hoare triple {19195#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {19195#false} is VALID [2022-04-08 03:35:40,270 INFO L290 TraceCheckUtils]: 84: Hoare triple {19195#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19195#false} is VALID [2022-04-08 03:35:40,270 INFO L290 TraceCheckUtils]: 83: Hoare triple {19195#false} ~i~0 := 0; {19195#false} is VALID [2022-04-08 03:35:40,270 INFO L290 TraceCheckUtils]: 82: Hoare triple {19524#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {19195#false} is VALID [2022-04-08 03:35:40,271 INFO L290 TraceCheckUtils]: 81: Hoare triple {19528#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {19524#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:35:40,271 INFO L290 TraceCheckUtils]: 80: Hoare triple {19528#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {19528#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:40,271 INFO L290 TraceCheckUtils]: 79: Hoare triple {19528#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {19528#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:40,271 INFO L290 TraceCheckUtils]: 78: Hoare triple {19538#(< 1 main_~edgecount~0)} ~i~0 := 0; {19528#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:40,272 INFO L290 TraceCheckUtils]: 77: Hoare triple {19538#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {19538#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:40,272 INFO L290 TraceCheckUtils]: 76: Hoare triple {19538#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19538#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:40,272 INFO L290 TraceCheckUtils]: 75: Hoare triple {19538#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {19538#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:40,272 INFO L290 TraceCheckUtils]: 74: Hoare triple {19538#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19538#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:40,273 INFO L290 TraceCheckUtils]: 73: Hoare triple {19538#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19538#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:40,273 INFO L290 TraceCheckUtils]: 72: Hoare triple {19301#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19538#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:40,273 INFO L290 TraceCheckUtils]: 71: Hoare triple {19291#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19301#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:40,274 INFO L290 TraceCheckUtils]: 70: Hoare triple {19291#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19291#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:40,274 INFO L290 TraceCheckUtils]: 69: Hoare triple {19291#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19291#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:40,274 INFO L290 TraceCheckUtils]: 68: Hoare triple {19569#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19291#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:40,275 INFO L290 TraceCheckUtils]: 67: Hoare triple {19569#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19569#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:35:40,275 INFO L290 TraceCheckUtils]: 66: Hoare triple {19569#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19569#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:35:40,275 INFO L290 TraceCheckUtils]: 65: Hoare triple {19579#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19569#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:35:40,276 INFO L290 TraceCheckUtils]: 64: Hoare triple {19579#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19579#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:35:40,276 INFO L290 TraceCheckUtils]: 63: Hoare triple {19579#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19579#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:35:40,276 INFO L290 TraceCheckUtils]: 62: Hoare triple {19589#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19579#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:35:40,277 INFO L290 TraceCheckUtils]: 61: Hoare triple {19589#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19589#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:35:40,277 INFO L290 TraceCheckUtils]: 60: Hoare triple {19589#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19589#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:35:40,277 INFO L290 TraceCheckUtils]: 59: Hoare triple {19599#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19589#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:35:40,278 INFO L290 TraceCheckUtils]: 58: Hoare triple {19599#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19599#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:35:40,278 INFO L290 TraceCheckUtils]: 57: Hoare triple {19599#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19599#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:35:40,278 INFO L290 TraceCheckUtils]: 56: Hoare triple {19609#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19599#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:35:40,278 INFO L290 TraceCheckUtils]: 55: Hoare triple {19609#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19609#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:35:40,279 INFO L290 TraceCheckUtils]: 54: Hoare triple {19609#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19609#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:35:40,279 INFO L290 TraceCheckUtils]: 53: Hoare triple {19619#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19609#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:35:40,279 INFO L290 TraceCheckUtils]: 52: Hoare triple {19619#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19619#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:35:40,280 INFO L290 TraceCheckUtils]: 51: Hoare triple {19619#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19619#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:35:40,280 INFO L290 TraceCheckUtils]: 50: Hoare triple {19629#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19619#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:35:40,280 INFO L290 TraceCheckUtils]: 49: Hoare triple {19629#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19629#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:35:40,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {19629#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19629#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:35:40,281 INFO L290 TraceCheckUtils]: 47: Hoare triple {19639#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19629#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:35:40,281 INFO L290 TraceCheckUtils]: 46: Hoare triple {19639#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19639#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:35:40,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {19639#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19639#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:35:40,282 INFO L290 TraceCheckUtils]: 44: Hoare triple {19649#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19639#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:35:40,282 INFO L290 TraceCheckUtils]: 43: Hoare triple {19649#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19649#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:35:40,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {19649#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19649#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:35:40,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {19659#(<= 0 (+ main_~j~0 10))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19649#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:35:40,283 INFO L290 TraceCheckUtils]: 40: Hoare triple {19659#(<= 0 (+ main_~j~0 10))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19659#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 03:35:40,283 INFO L290 TraceCheckUtils]: 39: Hoare triple {19659#(<= 0 (+ main_~j~0 10))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19659#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 03:35:40,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {19669#(<= 0 (+ main_~j~0 11))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19659#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 03:35:40,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {19669#(<= 0 (+ main_~j~0 11))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19669#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 03:35:40,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {19669#(<= 0 (+ main_~j~0 11))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19669#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 03:35:40,285 INFO L290 TraceCheckUtils]: 35: Hoare triple {19679#(<= 0 (+ main_~j~0 12))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19669#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 03:35:40,285 INFO L290 TraceCheckUtils]: 34: Hoare triple {19679#(<= 0 (+ main_~j~0 12))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19679#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 03:35:40,285 INFO L290 TraceCheckUtils]: 33: Hoare triple {19679#(<= 0 (+ main_~j~0 12))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19679#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 03:35:40,285 INFO L290 TraceCheckUtils]: 32: Hoare triple {19689#(<= 0 (+ main_~j~0 13))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19679#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 03:35:40,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {19689#(<= 0 (+ main_~j~0 13))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19689#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 03:35:40,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {19689#(<= 0 (+ main_~j~0 13))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19689#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 03:35:40,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {19699#(<= 0 (+ main_~j~0 14))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19689#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 03:35:40,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {19699#(<= 0 (+ main_~j~0 14))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19699#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 03:35:40,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {19699#(<= 0 (+ main_~j~0 14))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19699#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 03:35:40,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {19709#(<= 0 (+ main_~j~0 15))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19699#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 03:35:40,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {19709#(<= 0 (+ main_~j~0 15))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19709#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 03:35:40,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {19709#(<= 0 (+ main_~j~0 15))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19709#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 03:35:40,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {19709#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 03:35:40,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {19194#true} ~i~0 := 0; {19194#true} is VALID [2022-04-08 03:35:40,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {19194#true} assume !(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 03:35:40,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 03:35:40,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 03:35:40,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 03:35:40,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 03:35:40,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 03:35:40,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 03:35:40,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 03:35:40,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 03:35:40,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 03:35:40,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 03:35:40,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 03:35:40,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 03:35:40,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-08 03:35:40,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {19194#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-08 03:35:40,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-08 03:35:40,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {19194#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {19194#true} is VALID [2022-04-08 03:35:40,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {19194#true} call #t~ret22 := main(); {19194#true} is VALID [2022-04-08 03:35:40,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19194#true} {19194#true} #107#return; {19194#true} is VALID [2022-04-08 03:35:40,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {19194#true} assume true; {19194#true} is VALID [2022-04-08 03:35:40,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {19194#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {19194#true} is VALID [2022-04-08 03:35:40,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {19194#true} call ULTIMATE.init(); {19194#true} is VALID [2022-04-08 03:35:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 377 proven. 50 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 03:35:40,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872677371] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:40,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:40,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 60 [2022-04-08 03:35:40,291 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:40,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1864357977] [2022-04-08 03:35:40,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1864357977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:40,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:40,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 03:35:40,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590873356] [2022-04-08 03:35:40,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:40,291 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-08 03:35:40,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:40,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:40,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:40,344 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 03:35:40,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:40,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 03:35:40,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=849, Invalid=2691, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 03:35:40,346 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:41,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:41,454 INFO L93 Difference]: Finished difference Result 169 states and 214 transitions. [2022-04-08 03:35:41,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 03:35:41,455 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-08 03:35:41,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 133 transitions. [2022-04-08 03:35:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 133 transitions. [2022-04-08 03:35:41,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 133 transitions. [2022-04-08 03:35:41,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:41,573 INFO L225 Difference]: With dead ends: 169 [2022-04-08 03:35:41,573 INFO L226 Difference]: Without dead ends: 99 [2022-04-08 03:35:41,574 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1321, Invalid=4841, Unknown=0, NotChecked=0, Total=6162 [2022-04-08 03:35:41,575 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 176 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:41,575 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 70 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:35:41,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-08 03:35:41,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2022-04-08 03:35:41,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:41,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 97 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:41,790 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 97 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:41,791 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 97 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:41,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:41,797 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2022-04-08 03:35:41,797 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2022-04-08 03:35:41,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:41,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:41,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 99 states. [2022-04-08 03:35:41,798 INFO L87 Difference]: Start difference. First operand has 97 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 99 states. [2022-04-08 03:35:41,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:41,800 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2022-04-08 03:35:41,800 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2022-04-08 03:35:41,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:41,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:41,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:41,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2022-04-08 03:35:41,801 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 89 [2022-04-08 03:35:41,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:41,801 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 120 transitions. [2022-04-08 03:35:41,801 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:41,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 120 transitions. [2022-04-08 03:35:41,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 120 transitions. [2022-04-08 03:35:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 03:35:41,980 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:41,980 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 18, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:41,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-08 03:35:42,180 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-08 03:35:42,180 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:42,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:42,181 INFO L85 PathProgramCache]: Analyzing trace with hash 576720250, now seen corresponding path program 41 times [2022-04-08 03:35:42,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:42,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [416255998] [2022-04-08 03:35:42,183 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:42,183 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:42,183 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:42,184 INFO L85 PathProgramCache]: Analyzing trace with hash 576720250, now seen corresponding path program 42 times [2022-04-08 03:35:42,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:42,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151887623] [2022-04-08 03:35:42,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:42,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:42,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:42,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {20583#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {20558#true} is VALID [2022-04-08 03:35:42,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {20558#true} assume true; {20558#true} is VALID [2022-04-08 03:35:42,500 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20558#true} {20558#true} #107#return; {20558#true} is VALID [2022-04-08 03:35:42,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {20558#true} call ULTIMATE.init(); {20583#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:42,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {20583#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {20558#true} is VALID [2022-04-08 03:35:42,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {20558#true} assume true; {20558#true} is VALID [2022-04-08 03:35:42,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20558#true} {20558#true} #107#return; {20558#true} is VALID [2022-04-08 03:35:42,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {20558#true} call #t~ret22 := main(); {20558#true} is VALID [2022-04-08 03:35:42,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {20558#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:42,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:42,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:42,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:42,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:42,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:42,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:42,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:42,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:42,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:42,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:42,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:42,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:42,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:42,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:42,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:42,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:42,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:42,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {20564#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {20564#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20564#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {20564#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20564#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {20564#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20565#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:42,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {20565#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20565#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:42,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {20565#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20565#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:42,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {20565#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20566#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {20566#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20566#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {20566#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20566#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {20566#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20567#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:42,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {20567#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20567#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:42,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {20567#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20567#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:42,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {20567#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20568#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:42,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {20568#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20568#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:42,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {20568#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20568#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:42,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {20568#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20569#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:42,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {20569#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20569#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:42,517 INFO L290 TraceCheckUtils]: 40: Hoare triple {20569#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20569#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:42,517 INFO L290 TraceCheckUtils]: 41: Hoare triple {20569#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20570#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,518 INFO L290 TraceCheckUtils]: 42: Hoare triple {20570#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20570#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {20570#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20570#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,518 INFO L290 TraceCheckUtils]: 44: Hoare triple {20570#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20571#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,519 INFO L290 TraceCheckUtils]: 45: Hoare triple {20571#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20571#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,519 INFO L290 TraceCheckUtils]: 46: Hoare triple {20571#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20571#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,520 INFO L290 TraceCheckUtils]: 47: Hoare triple {20571#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20572#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,520 INFO L290 TraceCheckUtils]: 48: Hoare triple {20572#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20572#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {20572#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20572#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,521 INFO L290 TraceCheckUtils]: 50: Hoare triple {20572#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20573#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:42,521 INFO L290 TraceCheckUtils]: 51: Hoare triple {20573#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20573#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:42,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {20573#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20573#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:42,522 INFO L290 TraceCheckUtils]: 53: Hoare triple {20573#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20574#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,523 INFO L290 TraceCheckUtils]: 54: Hoare triple {20574#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20574#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,523 INFO L290 TraceCheckUtils]: 55: Hoare triple {20574#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20574#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,523 INFO L290 TraceCheckUtils]: 56: Hoare triple {20574#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20575#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,524 INFO L290 TraceCheckUtils]: 57: Hoare triple {20575#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20575#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,524 INFO L290 TraceCheckUtils]: 58: Hoare triple {20575#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20575#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,525 INFO L290 TraceCheckUtils]: 59: Hoare triple {20575#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20576#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,525 INFO L290 TraceCheckUtils]: 60: Hoare triple {20576#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20576#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,525 INFO L290 TraceCheckUtils]: 61: Hoare triple {20576#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20576#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,526 INFO L290 TraceCheckUtils]: 62: Hoare triple {20576#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20577#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,526 INFO L290 TraceCheckUtils]: 63: Hoare triple {20577#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20577#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,527 INFO L290 TraceCheckUtils]: 64: Hoare triple {20577#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20577#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,527 INFO L290 TraceCheckUtils]: 65: Hoare triple {20577#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20578#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,527 INFO L290 TraceCheckUtils]: 66: Hoare triple {20578#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20578#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,528 INFO L290 TraceCheckUtils]: 67: Hoare triple {20578#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20578#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,528 INFO L290 TraceCheckUtils]: 68: Hoare triple {20578#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20579#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,529 INFO L290 TraceCheckUtils]: 69: Hoare triple {20579#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20579#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,529 INFO L290 TraceCheckUtils]: 70: Hoare triple {20579#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20579#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:42,529 INFO L290 TraceCheckUtils]: 71: Hoare triple {20579#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20580#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-08 03:35:42,530 INFO L290 TraceCheckUtils]: 72: Hoare triple {20580#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20580#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-08 03:35:42,530 INFO L290 TraceCheckUtils]: 73: Hoare triple {20580#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20580#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-08 03:35:42,531 INFO L290 TraceCheckUtils]: 74: Hoare triple {20580#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20581#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-08 03:35:42,531 INFO L290 TraceCheckUtils]: 75: Hoare triple {20581#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20581#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-08 03:35:42,531 INFO L290 TraceCheckUtils]: 76: Hoare triple {20581#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20581#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-08 03:35:42,532 INFO L290 TraceCheckUtils]: 77: Hoare triple {20581#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20582#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} is VALID [2022-04-08 03:35:42,532 INFO L290 TraceCheckUtils]: 78: Hoare triple {20582#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} assume !(~j~0 < ~edgecount~0); {20559#false} is VALID [2022-04-08 03:35:42,532 INFO L290 TraceCheckUtils]: 79: Hoare triple {20559#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {20559#false} is VALID [2022-04-08 03:35:42,532 INFO L290 TraceCheckUtils]: 80: Hoare triple {20559#false} assume !(~i~0 < ~nodecount~0); {20559#false} is VALID [2022-04-08 03:35:42,532 INFO L290 TraceCheckUtils]: 81: Hoare triple {20559#false} ~i~0 := 0; {20559#false} is VALID [2022-04-08 03:35:42,532 INFO L290 TraceCheckUtils]: 82: Hoare triple {20559#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {20559#false} is VALID [2022-04-08 03:35:42,532 INFO L290 TraceCheckUtils]: 83: Hoare triple {20559#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {20559#false} is VALID [2022-04-08 03:35:42,533 INFO L290 TraceCheckUtils]: 84: Hoare triple {20559#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20559#false} is VALID [2022-04-08 03:35:42,533 INFO L290 TraceCheckUtils]: 85: Hoare triple {20559#false} assume !(~i~0 < ~edgecount~0); {20559#false} is VALID [2022-04-08 03:35:42,533 INFO L290 TraceCheckUtils]: 86: Hoare triple {20559#false} ~i~0 := 0; {20559#false} is VALID [2022-04-08 03:35:42,533 INFO L290 TraceCheckUtils]: 87: Hoare triple {20559#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20559#false} is VALID [2022-04-08 03:35:42,533 INFO L272 TraceCheckUtils]: 88: Hoare triple {20559#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {20559#false} is VALID [2022-04-08 03:35:42,533 INFO L290 TraceCheckUtils]: 89: Hoare triple {20559#false} ~cond := #in~cond; {20559#false} is VALID [2022-04-08 03:35:42,533 INFO L290 TraceCheckUtils]: 90: Hoare triple {20559#false} assume 0 == ~cond; {20559#false} is VALID [2022-04-08 03:35:42,533 INFO L290 TraceCheckUtils]: 91: Hoare triple {20559#false} assume !false; {20559#false} is VALID [2022-04-08 03:35:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 1 proven. 477 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:42,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:42,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151887623] [2022-04-08 03:35:42,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151887623] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:42,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701089961] [2022-04-08 03:35:42,534 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:35:42,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:42,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:42,535 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:42,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 03:35:42,684 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 03:35:42,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:42,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 03:35:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:42,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:43,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {20558#true} call ULTIMATE.init(); {20558#true} is VALID [2022-04-08 03:35:43,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {20558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {20558#true} is VALID [2022-04-08 03:35:43,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {20558#true} assume true; {20558#true} is VALID [2022-04-08 03:35:43,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20558#true} {20558#true} #107#return; {20558#true} is VALID [2022-04-08 03:35:43,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {20558#true} call #t~ret22 := main(); {20558#true} is VALID [2022-04-08 03:35:43,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {20558#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {20602#(<= 20 main_~edgecount~0)} ~i~0 := 0; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,024 INFO L290 TraceCheckUtils]: 36: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,024 INFO L290 TraceCheckUtils]: 37: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,024 INFO L290 TraceCheckUtils]: 38: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,025 INFO L290 TraceCheckUtils]: 39: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,025 INFO L290 TraceCheckUtils]: 40: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,025 INFO L290 TraceCheckUtils]: 41: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,025 INFO L290 TraceCheckUtils]: 42: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,026 INFO L290 TraceCheckUtils]: 44: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,026 INFO L290 TraceCheckUtils]: 45: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,026 INFO L290 TraceCheckUtils]: 46: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,026 INFO L290 TraceCheckUtils]: 47: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,027 INFO L290 TraceCheckUtils]: 50: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,027 INFO L290 TraceCheckUtils]: 51: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,028 INFO L290 TraceCheckUtils]: 52: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,031 INFO L290 TraceCheckUtils]: 53: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,031 INFO L290 TraceCheckUtils]: 54: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,032 INFO L290 TraceCheckUtils]: 55: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,032 INFO L290 TraceCheckUtils]: 56: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,032 INFO L290 TraceCheckUtils]: 57: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,032 INFO L290 TraceCheckUtils]: 58: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,033 INFO L290 TraceCheckUtils]: 59: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,033 INFO L290 TraceCheckUtils]: 60: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,033 INFO L290 TraceCheckUtils]: 61: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,033 INFO L290 TraceCheckUtils]: 62: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,034 INFO L290 TraceCheckUtils]: 63: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,034 INFO L290 TraceCheckUtils]: 64: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,034 INFO L290 TraceCheckUtils]: 65: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,034 INFO L290 TraceCheckUtils]: 66: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,035 INFO L290 TraceCheckUtils]: 67: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,035 INFO L290 TraceCheckUtils]: 68: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,035 INFO L290 TraceCheckUtils]: 69: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,035 INFO L290 TraceCheckUtils]: 70: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,036 INFO L290 TraceCheckUtils]: 71: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,036 INFO L290 TraceCheckUtils]: 72: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,036 INFO L290 TraceCheckUtils]: 73: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,036 INFO L290 TraceCheckUtils]: 74: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,037 INFO L290 TraceCheckUtils]: 75: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,037 INFO L290 TraceCheckUtils]: 76: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,037 INFO L290 TraceCheckUtils]: 77: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,037 INFO L290 TraceCheckUtils]: 78: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,038 INFO L290 TraceCheckUtils]: 79: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,038 INFO L290 TraceCheckUtils]: 80: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,038 INFO L290 TraceCheckUtils]: 81: Hoare triple {20602#(<= 20 main_~edgecount~0)} ~i~0 := 0; {20831#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:43,039 INFO L290 TraceCheckUtils]: 82: Hoare triple {20831#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {20831#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:43,039 INFO L290 TraceCheckUtils]: 83: Hoare triple {20831#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {20831#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:43,040 INFO L290 TraceCheckUtils]: 84: Hoare triple {20831#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20841#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:43,040 INFO L290 TraceCheckUtils]: 85: Hoare triple {20841#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {20559#false} is VALID [2022-04-08 03:35:43,040 INFO L290 TraceCheckUtils]: 86: Hoare triple {20559#false} ~i~0 := 0; {20559#false} is VALID [2022-04-08 03:35:43,040 INFO L290 TraceCheckUtils]: 87: Hoare triple {20559#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20559#false} is VALID [2022-04-08 03:35:43,040 INFO L272 TraceCheckUtils]: 88: Hoare triple {20559#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {20559#false} is VALID [2022-04-08 03:35:43,040 INFO L290 TraceCheckUtils]: 89: Hoare triple {20559#false} ~cond := #in~cond; {20559#false} is VALID [2022-04-08 03:35:43,040 INFO L290 TraceCheckUtils]: 90: Hoare triple {20559#false} assume 0 == ~cond; {20559#false} is VALID [2022-04-08 03:35:43,040 INFO L290 TraceCheckUtils]: 91: Hoare triple {20559#false} assume !false; {20559#false} is VALID [2022-04-08 03:35:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2022-04-08 03:35:43,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:43,317 INFO L290 TraceCheckUtils]: 91: Hoare triple {20559#false} assume !false; {20559#false} is VALID [2022-04-08 03:35:43,317 INFO L290 TraceCheckUtils]: 90: Hoare triple {20559#false} assume 0 == ~cond; {20559#false} is VALID [2022-04-08 03:35:43,317 INFO L290 TraceCheckUtils]: 89: Hoare triple {20559#false} ~cond := #in~cond; {20559#false} is VALID [2022-04-08 03:35:43,317 INFO L272 TraceCheckUtils]: 88: Hoare triple {20559#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {20559#false} is VALID [2022-04-08 03:35:43,317 INFO L290 TraceCheckUtils]: 87: Hoare triple {20559#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20559#false} is VALID [2022-04-08 03:35:43,317 INFO L290 TraceCheckUtils]: 86: Hoare triple {20559#false} ~i~0 := 0; {20559#false} is VALID [2022-04-08 03:35:43,317 INFO L290 TraceCheckUtils]: 85: Hoare triple {20881#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {20559#false} is VALID [2022-04-08 03:35:43,318 INFO L290 TraceCheckUtils]: 84: Hoare triple {20885#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20881#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,318 INFO L290 TraceCheckUtils]: 83: Hoare triple {20885#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {20885#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:43,318 INFO L290 TraceCheckUtils]: 82: Hoare triple {20885#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {20885#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:43,318 INFO L290 TraceCheckUtils]: 81: Hoare triple {20895#(< 1 main_~edgecount~0)} ~i~0 := 0; {20885#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:43,319 INFO L290 TraceCheckUtils]: 80: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,319 INFO L290 TraceCheckUtils]: 79: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,319 INFO L290 TraceCheckUtils]: 78: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,319 INFO L290 TraceCheckUtils]: 77: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,320 INFO L290 TraceCheckUtils]: 76: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,320 INFO L290 TraceCheckUtils]: 75: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,320 INFO L290 TraceCheckUtils]: 74: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,320 INFO L290 TraceCheckUtils]: 73: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,321 INFO L290 TraceCheckUtils]: 72: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,321 INFO L290 TraceCheckUtils]: 71: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,321 INFO L290 TraceCheckUtils]: 70: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,321 INFO L290 TraceCheckUtils]: 69: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,321 INFO L290 TraceCheckUtils]: 68: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,322 INFO L290 TraceCheckUtils]: 67: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,322 INFO L290 TraceCheckUtils]: 66: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,322 INFO L290 TraceCheckUtils]: 65: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,322 INFO L290 TraceCheckUtils]: 64: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,323 INFO L290 TraceCheckUtils]: 63: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,323 INFO L290 TraceCheckUtils]: 62: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,323 INFO L290 TraceCheckUtils]: 61: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,323 INFO L290 TraceCheckUtils]: 60: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,324 INFO L290 TraceCheckUtils]: 59: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,324 INFO L290 TraceCheckUtils]: 58: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,324 INFO L290 TraceCheckUtils]: 57: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,324 INFO L290 TraceCheckUtils]: 56: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,325 INFO L290 TraceCheckUtils]: 55: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,325 INFO L290 TraceCheckUtils]: 54: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,325 INFO L290 TraceCheckUtils]: 53: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,325 INFO L290 TraceCheckUtils]: 52: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,326 INFO L290 TraceCheckUtils]: 51: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,326 INFO L290 TraceCheckUtils]: 50: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,326 INFO L290 TraceCheckUtils]: 49: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,326 INFO L290 TraceCheckUtils]: 48: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,326 INFO L290 TraceCheckUtils]: 47: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,327 INFO L290 TraceCheckUtils]: 46: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,327 INFO L290 TraceCheckUtils]: 45: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,327 INFO L290 TraceCheckUtils]: 44: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,327 INFO L290 TraceCheckUtils]: 43: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,328 INFO L290 TraceCheckUtils]: 42: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,328 INFO L290 TraceCheckUtils]: 41: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,330 INFO L290 TraceCheckUtils]: 34: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,330 INFO L290 TraceCheckUtils]: 33: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,330 INFO L290 TraceCheckUtils]: 32: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {20895#(< 1 main_~edgecount~0)} ~i~0 := 0; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {20895#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {20558#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:43,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {20558#true} call #t~ret22 := main(); {20558#true} is VALID [2022-04-08 03:35:43,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20558#true} {20558#true} #107#return; {20558#true} is VALID [2022-04-08 03:35:43,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {20558#true} assume true; {20558#true} is VALID [2022-04-08 03:35:43,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {20558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {20558#true} is VALID [2022-04-08 03:35:43,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {20558#true} call ULTIMATE.init(); {20558#true} is VALID [2022-04-08 03:35:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2022-04-08 03:35:43,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701089961] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:43,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:43,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 5, 5] total 29 [2022-04-08 03:35:43,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:43,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [416255998] [2022-04-08 03:35:43,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [416255998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:43,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:43,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 03:35:43,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989610132] [2022-04-08 03:35:43,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:43,339 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-08 03:35:43,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:43,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:43,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:43,405 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 03:35:43,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:43,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 03:35:43,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=516, Unknown=0, NotChecked=0, Total=812 [2022-04-08 03:35:43,406 INFO L87 Difference]: Start difference. First operand 97 states and 120 transitions. Second operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:44,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:44,282 INFO L93 Difference]: Finished difference Result 175 states and 222 transitions. [2022-04-08 03:35:44,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 03:35:44,282 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-08 03:35:44,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:44,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 137 transitions. [2022-04-08 03:35:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:44,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 137 transitions. [2022-04-08 03:35:44,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 137 transitions. [2022-04-08 03:35:44,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:44,386 INFO L225 Difference]: With dead ends: 175 [2022-04-08 03:35:44,386 INFO L226 Difference]: Without dead ends: 102 [2022-04-08 03:35:44,387 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=1556, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 03:35:44,387 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 200 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:44,387 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 45 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:44,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-08 03:35:44,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2022-04-08 03:35:44,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:44,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:44,603 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:44,603 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:44,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:44,604 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2022-04-08 03:35:44,604 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2022-04-08 03:35:44,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:44,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:44,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 102 states. [2022-04-08 03:35:44,605 INFO L87 Difference]: Start difference. First operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 102 states. [2022-04-08 03:35:44,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:44,606 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2022-04-08 03:35:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2022-04-08 03:35:44,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:44,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:44,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:44,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:44,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2022-04-08 03:35:44,620 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 92 [2022-04-08 03:35:44,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:44,620 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2022-04-08 03:35:44,620 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:44,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 124 transitions. [2022-04-08 03:35:44,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2022-04-08 03:35:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-08 03:35:44,809 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:44,809 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 19, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:44,826 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-08 03:35:45,010 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:45,010 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:45,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:45,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1272730321, now seen corresponding path program 43 times [2022-04-08 03:35:45,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:45,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127331927] [2022-04-08 03:35:45,013 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:45,013 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:45,013 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:45,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1272730321, now seen corresponding path program 44 times [2022-04-08 03:35:45,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:45,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861783258] [2022-04-08 03:35:45,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:45,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:45,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:45,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {21961#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {21935#true} is VALID [2022-04-08 03:35:45,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {21935#true} assume true; {21935#true} is VALID [2022-04-08 03:35:45,355 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21935#true} {21935#true} #107#return; {21935#true} is VALID [2022-04-08 03:35:45,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {21935#true} call ULTIMATE.init(); {21961#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:45,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {21961#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {21935#true} is VALID [2022-04-08 03:35:45,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {21935#true} assume true; {21935#true} is VALID [2022-04-08 03:35:45,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21935#true} {21935#true} #107#return; {21935#true} is VALID [2022-04-08 03:35:45,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {21935#true} call #t~ret22 := main(); {21935#true} is VALID [2022-04-08 03:35:45,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {21935#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:45,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:45,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:45,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:45,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:45,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:45,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:45,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:45,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:45,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:45,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:45,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:45,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:45,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:45,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:45,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:45,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:45,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:35:45,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {21941#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {21941#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21941#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {21941#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21941#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {21941#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21942#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:45,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {21942#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21942#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:45,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {21942#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21942#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:45,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {21942#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21943#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {21943#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21943#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {21943#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21943#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {21943#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21944#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:45,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {21944#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21944#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:45,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {21944#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21944#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:45,366 INFO L290 TraceCheckUtils]: 35: Hoare triple {21944#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21945#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:45,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {21945#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21945#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:45,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {21945#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21945#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:45,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {21945#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21946#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:45,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {21946#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21946#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:45,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {21946#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21946#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:45,369 INFO L290 TraceCheckUtils]: 41: Hoare triple {21946#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21947#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {21947#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21947#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {21947#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21947#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {21947#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21948#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {21948#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21948#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {21948#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21948#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,371 INFO L290 TraceCheckUtils]: 47: Hoare triple {21948#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21949#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,372 INFO L290 TraceCheckUtils]: 48: Hoare triple {21949#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21949#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,372 INFO L290 TraceCheckUtils]: 49: Hoare triple {21949#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21949#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,372 INFO L290 TraceCheckUtils]: 50: Hoare triple {21949#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21950#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:45,373 INFO L290 TraceCheckUtils]: 51: Hoare triple {21950#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21950#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:45,373 INFO L290 TraceCheckUtils]: 52: Hoare triple {21950#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21950#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:45,374 INFO L290 TraceCheckUtils]: 53: Hoare triple {21950#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21951#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,374 INFO L290 TraceCheckUtils]: 54: Hoare triple {21951#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21951#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,374 INFO L290 TraceCheckUtils]: 55: Hoare triple {21951#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21951#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,375 INFO L290 TraceCheckUtils]: 56: Hoare triple {21951#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21952#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,375 INFO L290 TraceCheckUtils]: 57: Hoare triple {21952#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21952#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,376 INFO L290 TraceCheckUtils]: 58: Hoare triple {21952#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21952#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,376 INFO L290 TraceCheckUtils]: 59: Hoare triple {21952#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21953#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,376 INFO L290 TraceCheckUtils]: 60: Hoare triple {21953#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21953#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,377 INFO L290 TraceCheckUtils]: 61: Hoare triple {21953#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21953#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,377 INFO L290 TraceCheckUtils]: 62: Hoare triple {21953#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21954#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,377 INFO L290 TraceCheckUtils]: 63: Hoare triple {21954#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21954#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,378 INFO L290 TraceCheckUtils]: 64: Hoare triple {21954#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21954#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,378 INFO L290 TraceCheckUtils]: 65: Hoare triple {21954#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21955#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,379 INFO L290 TraceCheckUtils]: 66: Hoare triple {21955#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21955#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,379 INFO L290 TraceCheckUtils]: 67: Hoare triple {21955#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21955#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,379 INFO L290 TraceCheckUtils]: 68: Hoare triple {21955#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21956#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,380 INFO L290 TraceCheckUtils]: 69: Hoare triple {21956#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21956#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,380 INFO L290 TraceCheckUtils]: 70: Hoare triple {21956#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21956#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:35:45,381 INFO L290 TraceCheckUtils]: 71: Hoare triple {21956#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21957#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-08 03:35:45,381 INFO L290 TraceCheckUtils]: 72: Hoare triple {21957#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21957#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-08 03:35:45,381 INFO L290 TraceCheckUtils]: 73: Hoare triple {21957#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21957#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-08 03:35:45,382 INFO L290 TraceCheckUtils]: 74: Hoare triple {21957#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21958#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-08 03:35:45,382 INFO L290 TraceCheckUtils]: 75: Hoare triple {21958#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21958#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-08 03:35:45,383 INFO L290 TraceCheckUtils]: 76: Hoare triple {21958#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21958#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-08 03:35:45,383 INFO L290 TraceCheckUtils]: 77: Hoare triple {21958#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21959#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} is VALID [2022-04-08 03:35:45,383 INFO L290 TraceCheckUtils]: 78: Hoare triple {21959#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21959#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} is VALID [2022-04-08 03:35:45,384 INFO L290 TraceCheckUtils]: 79: Hoare triple {21959#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21959#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} is VALID [2022-04-08 03:35:45,384 INFO L290 TraceCheckUtils]: 80: Hoare triple {21959#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21960#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 19))} is VALID [2022-04-08 03:35:45,385 INFO L290 TraceCheckUtils]: 81: Hoare triple {21960#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 19))} assume !(~j~0 < ~edgecount~0); {21936#false} is VALID [2022-04-08 03:35:45,385 INFO L290 TraceCheckUtils]: 82: Hoare triple {21936#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {21936#false} is VALID [2022-04-08 03:35:45,385 INFO L290 TraceCheckUtils]: 83: Hoare triple {21936#false} assume !(~i~0 < ~nodecount~0); {21936#false} is VALID [2022-04-08 03:35:45,385 INFO L290 TraceCheckUtils]: 84: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-08 03:35:45,385 INFO L290 TraceCheckUtils]: 85: Hoare triple {21936#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {21936#false} is VALID [2022-04-08 03:35:45,385 INFO L290 TraceCheckUtils]: 86: Hoare triple {21936#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {21936#false} is VALID [2022-04-08 03:35:45,385 INFO L290 TraceCheckUtils]: 87: Hoare triple {21936#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {21936#false} is VALID [2022-04-08 03:35:45,385 INFO L290 TraceCheckUtils]: 88: Hoare triple {21936#false} assume !(~i~0 < ~edgecount~0); {21936#false} is VALID [2022-04-08 03:35:45,385 INFO L290 TraceCheckUtils]: 89: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-08 03:35:45,385 INFO L290 TraceCheckUtils]: 90: Hoare triple {21936#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21936#false} is VALID [2022-04-08 03:35:45,385 INFO L272 TraceCheckUtils]: 91: Hoare triple {21936#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {21936#false} is VALID [2022-04-08 03:35:45,385 INFO L290 TraceCheckUtils]: 92: Hoare triple {21936#false} ~cond := #in~cond; {21936#false} is VALID [2022-04-08 03:35:45,385 INFO L290 TraceCheckUtils]: 93: Hoare triple {21936#false} assume 0 == ~cond; {21936#false} is VALID [2022-04-08 03:35:45,385 INFO L290 TraceCheckUtils]: 94: Hoare triple {21936#false} assume !false; {21936#false} is VALID [2022-04-08 03:35:45,386 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 1 proven. 532 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:45,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:45,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861783258] [2022-04-08 03:35:45,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861783258] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:45,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596807354] [2022-04-08 03:35:45,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:45,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:45,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:45,387 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:45,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 03:35:45,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:45,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:45,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 03:35:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:45,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:46,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {21935#true} call ULTIMATE.init(); {21935#true} is VALID [2022-04-08 03:35:46,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {21935#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {21935#true} is VALID [2022-04-08 03:35:46,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {21935#true} assume true; {21935#true} is VALID [2022-04-08 03:35:46,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21935#true} {21935#true} #107#return; {21935#true} is VALID [2022-04-08 03:35:46,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {21935#true} call #t~ret22 := main(); {21935#true} is VALID [2022-04-08 03:35:46,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {21935#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:46,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:46,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:46,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:46,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:46,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:46,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:46,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:46,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:46,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:46,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:46,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:46,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:46,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:46,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:46,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:46,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:46,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {21980#(<= 20 main_~edgecount~0)} ~i~0 := 0; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:46,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {22035#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 03:35:46,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {22035#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22035#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 03:35:46,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {22035#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22035#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-08 03:35:46,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {22035#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22045#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:46,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {22045#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22045#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:46,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {22045#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22045#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:46,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {22045#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22055#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {22055#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22055#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {22055#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22055#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {22055#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22065#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:46,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {22065#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22065#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:46,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {22065#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22065#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:35:46,477 INFO L290 TraceCheckUtils]: 35: Hoare triple {22065#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22075#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:46,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {22075#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22075#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:46,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {22075#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22075#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-08 03:35:46,478 INFO L290 TraceCheckUtils]: 38: Hoare triple {22075#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22085#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:46,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {22085#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22085#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:46,479 INFO L290 TraceCheckUtils]: 40: Hoare triple {22085#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22085#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-08 03:35:46,479 INFO L290 TraceCheckUtils]: 41: Hoare triple {22085#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22095#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,479 INFO L290 TraceCheckUtils]: 42: Hoare triple {22095#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22095#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,480 INFO L290 TraceCheckUtils]: 43: Hoare triple {22095#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22095#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,480 INFO L290 TraceCheckUtils]: 44: Hoare triple {22095#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22105#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,481 INFO L290 TraceCheckUtils]: 45: Hoare triple {22105#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22105#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,481 INFO L290 TraceCheckUtils]: 46: Hoare triple {22105#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22105#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,481 INFO L290 TraceCheckUtils]: 47: Hoare triple {22105#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22115#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,482 INFO L290 TraceCheckUtils]: 48: Hoare triple {22115#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22115#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {22115#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22115#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,483 INFO L290 TraceCheckUtils]: 50: Hoare triple {22115#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22125#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:46,483 INFO L290 TraceCheckUtils]: 51: Hoare triple {22125#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22125#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:46,483 INFO L290 TraceCheckUtils]: 52: Hoare triple {22125#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22125#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-08 03:35:46,484 INFO L290 TraceCheckUtils]: 53: Hoare triple {22125#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22135#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,484 INFO L290 TraceCheckUtils]: 54: Hoare triple {22135#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22135#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,485 INFO L290 TraceCheckUtils]: 55: Hoare triple {22135#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22135#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,485 INFO L290 TraceCheckUtils]: 56: Hoare triple {22135#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22145#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,485 INFO L290 TraceCheckUtils]: 57: Hoare triple {22145#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22145#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,486 INFO L290 TraceCheckUtils]: 58: Hoare triple {22145#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22145#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,486 INFO L290 TraceCheckUtils]: 59: Hoare triple {22145#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22155#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,487 INFO L290 TraceCheckUtils]: 60: Hoare triple {22155#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22155#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,487 INFO L290 TraceCheckUtils]: 61: Hoare triple {22155#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22155#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,487 INFO L290 TraceCheckUtils]: 62: Hoare triple {22155#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22165#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,488 INFO L290 TraceCheckUtils]: 63: Hoare triple {22165#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22165#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,488 INFO L290 TraceCheckUtils]: 64: Hoare triple {22165#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22165#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,489 INFO L290 TraceCheckUtils]: 65: Hoare triple {22165#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22175#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,489 INFO L290 TraceCheckUtils]: 66: Hoare triple {22175#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22175#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,489 INFO L290 TraceCheckUtils]: 67: Hoare triple {22175#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22175#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,490 INFO L290 TraceCheckUtils]: 68: Hoare triple {22175#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22185#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,490 INFO L290 TraceCheckUtils]: 69: Hoare triple {22185#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22185#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,491 INFO L290 TraceCheckUtils]: 70: Hoare triple {22185#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22185#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:46,491 INFO L290 TraceCheckUtils]: 71: Hoare triple {22185#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22195#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} is VALID [2022-04-08 03:35:46,491 INFO L290 TraceCheckUtils]: 72: Hoare triple {22195#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22195#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} is VALID [2022-04-08 03:35:46,492 INFO L290 TraceCheckUtils]: 73: Hoare triple {22195#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22195#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} is VALID [2022-04-08 03:35:46,492 INFO L290 TraceCheckUtils]: 74: Hoare triple {22195#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22205#(and (<= 20 main_~edgecount~0) (<= main_~j~0 17))} is VALID [2022-04-08 03:35:46,493 INFO L290 TraceCheckUtils]: 75: Hoare triple {22205#(and (<= 20 main_~edgecount~0) (<= main_~j~0 17))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22205#(and (<= 20 main_~edgecount~0) (<= main_~j~0 17))} is VALID [2022-04-08 03:35:46,493 INFO L290 TraceCheckUtils]: 76: Hoare triple {22205#(and (<= 20 main_~edgecount~0) (<= main_~j~0 17))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22205#(and (<= 20 main_~edgecount~0) (<= main_~j~0 17))} is VALID [2022-04-08 03:35:46,493 INFO L290 TraceCheckUtils]: 77: Hoare triple {22205#(and (<= 20 main_~edgecount~0) (<= main_~j~0 17))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22215#(and (<= 20 main_~edgecount~0) (<= main_~j~0 18))} is VALID [2022-04-08 03:35:46,494 INFO L290 TraceCheckUtils]: 78: Hoare triple {22215#(and (<= 20 main_~edgecount~0) (<= main_~j~0 18))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22215#(and (<= 20 main_~edgecount~0) (<= main_~j~0 18))} is VALID [2022-04-08 03:35:46,494 INFO L290 TraceCheckUtils]: 79: Hoare triple {22215#(and (<= 20 main_~edgecount~0) (<= main_~j~0 18))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22215#(and (<= 20 main_~edgecount~0) (<= main_~j~0 18))} is VALID [2022-04-08 03:35:46,495 INFO L290 TraceCheckUtils]: 80: Hoare triple {22215#(and (<= 20 main_~edgecount~0) (<= main_~j~0 18))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22225#(and (<= 20 main_~edgecount~0) (<= main_~j~0 19))} is VALID [2022-04-08 03:35:46,495 INFO L290 TraceCheckUtils]: 81: Hoare triple {22225#(and (<= 20 main_~edgecount~0) (<= main_~j~0 19))} assume !(~j~0 < ~edgecount~0); {21936#false} is VALID [2022-04-08 03:35:46,495 INFO L290 TraceCheckUtils]: 82: Hoare triple {21936#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {21936#false} is VALID [2022-04-08 03:35:46,495 INFO L290 TraceCheckUtils]: 83: Hoare triple {21936#false} assume !(~i~0 < ~nodecount~0); {21936#false} is VALID [2022-04-08 03:35:46,495 INFO L290 TraceCheckUtils]: 84: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-08 03:35:46,495 INFO L290 TraceCheckUtils]: 85: Hoare triple {21936#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {21936#false} is VALID [2022-04-08 03:35:46,495 INFO L290 TraceCheckUtils]: 86: Hoare triple {21936#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {21936#false} is VALID [2022-04-08 03:35:46,495 INFO L290 TraceCheckUtils]: 87: Hoare triple {21936#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {21936#false} is VALID [2022-04-08 03:35:46,495 INFO L290 TraceCheckUtils]: 88: Hoare triple {21936#false} assume !(~i~0 < ~edgecount~0); {21936#false} is VALID [2022-04-08 03:35:46,495 INFO L290 TraceCheckUtils]: 89: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-08 03:35:46,495 INFO L290 TraceCheckUtils]: 90: Hoare triple {21936#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21936#false} is VALID [2022-04-08 03:35:46,496 INFO L272 TraceCheckUtils]: 91: Hoare triple {21936#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {21936#false} is VALID [2022-04-08 03:35:46,496 INFO L290 TraceCheckUtils]: 92: Hoare triple {21936#false} ~cond := #in~cond; {21936#false} is VALID [2022-04-08 03:35:46,496 INFO L290 TraceCheckUtils]: 93: Hoare triple {21936#false} assume 0 == ~cond; {21936#false} is VALID [2022-04-08 03:35:46,496 INFO L290 TraceCheckUtils]: 94: Hoare triple {21936#false} assume !false; {21936#false} is VALID [2022-04-08 03:35:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 1 proven. 532 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:46,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:47,252 INFO L290 TraceCheckUtils]: 94: Hoare triple {21936#false} assume !false; {21936#false} is VALID [2022-04-08 03:35:47,252 INFO L290 TraceCheckUtils]: 93: Hoare triple {21936#false} assume 0 == ~cond; {21936#false} is VALID [2022-04-08 03:35:47,252 INFO L290 TraceCheckUtils]: 92: Hoare triple {21936#false} ~cond := #in~cond; {21936#false} is VALID [2022-04-08 03:35:47,252 INFO L272 TraceCheckUtils]: 91: Hoare triple {21936#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {21936#false} is VALID [2022-04-08 03:35:47,252 INFO L290 TraceCheckUtils]: 90: Hoare triple {21936#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21936#false} is VALID [2022-04-08 03:35:47,253 INFO L290 TraceCheckUtils]: 89: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-08 03:35:47,253 INFO L290 TraceCheckUtils]: 88: Hoare triple {21936#false} assume !(~i~0 < ~edgecount~0); {21936#false} is VALID [2022-04-08 03:35:47,253 INFO L290 TraceCheckUtils]: 87: Hoare triple {21936#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {21936#false} is VALID [2022-04-08 03:35:47,253 INFO L290 TraceCheckUtils]: 86: Hoare triple {21936#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {21936#false} is VALID [2022-04-08 03:35:47,253 INFO L290 TraceCheckUtils]: 85: Hoare triple {21936#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {21936#false} is VALID [2022-04-08 03:35:47,253 INFO L290 TraceCheckUtils]: 84: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-08 03:35:47,253 INFO L290 TraceCheckUtils]: 83: Hoare triple {21936#false} assume !(~i~0 < ~nodecount~0); {21936#false} is VALID [2022-04-08 03:35:47,253 INFO L290 TraceCheckUtils]: 82: Hoare triple {21936#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {21936#false} is VALID [2022-04-08 03:35:47,253 INFO L290 TraceCheckUtils]: 81: Hoare triple {22307#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {21936#false} is VALID [2022-04-08 03:35:47,254 INFO L290 TraceCheckUtils]: 80: Hoare triple {22311#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22307#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,254 INFO L290 TraceCheckUtils]: 79: Hoare triple {22311#(< (+ main_~j~0 1) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22311#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,254 INFO L290 TraceCheckUtils]: 78: Hoare triple {22311#(< (+ main_~j~0 1) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22311#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,254 INFO L290 TraceCheckUtils]: 77: Hoare triple {22321#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22311#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,255 INFO L290 TraceCheckUtils]: 76: Hoare triple {22321#(< (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22321#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,255 INFO L290 TraceCheckUtils]: 75: Hoare triple {22321#(< (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22321#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,256 INFO L290 TraceCheckUtils]: 74: Hoare triple {22331#(< (+ main_~j~0 3) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22321#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,256 INFO L290 TraceCheckUtils]: 73: Hoare triple {22331#(< (+ main_~j~0 3) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22331#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,256 INFO L290 TraceCheckUtils]: 72: Hoare triple {22331#(< (+ main_~j~0 3) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22331#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,257 INFO L290 TraceCheckUtils]: 71: Hoare triple {22341#(< (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22331#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,257 INFO L290 TraceCheckUtils]: 70: Hoare triple {22341#(< (+ main_~j~0 4) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22341#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,257 INFO L290 TraceCheckUtils]: 69: Hoare triple {22341#(< (+ main_~j~0 4) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22341#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,258 INFO L290 TraceCheckUtils]: 68: Hoare triple {22351#(< (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22341#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,258 INFO L290 TraceCheckUtils]: 67: Hoare triple {22351#(< (+ 5 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22351#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,258 INFO L290 TraceCheckUtils]: 66: Hoare triple {22351#(< (+ 5 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22351#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,258 INFO L290 TraceCheckUtils]: 65: Hoare triple {22361#(< (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22351#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,259 INFO L290 TraceCheckUtils]: 64: Hoare triple {22361#(< (+ main_~j~0 6) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22361#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,259 INFO L290 TraceCheckUtils]: 63: Hoare triple {22361#(< (+ main_~j~0 6) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22361#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,260 INFO L290 TraceCheckUtils]: 62: Hoare triple {22371#(< (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22361#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,260 INFO L290 TraceCheckUtils]: 61: Hoare triple {22371#(< (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22371#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,260 INFO L290 TraceCheckUtils]: 60: Hoare triple {22371#(< (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22371#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,260 INFO L290 TraceCheckUtils]: 59: Hoare triple {22381#(< (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22371#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,261 INFO L290 TraceCheckUtils]: 58: Hoare triple {22381#(< (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22381#(< (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,261 INFO L290 TraceCheckUtils]: 57: Hoare triple {22381#(< (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22381#(< (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,261 INFO L290 TraceCheckUtils]: 56: Hoare triple {22391#(< (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22381#(< (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,262 INFO L290 TraceCheckUtils]: 55: Hoare triple {22391#(< (+ main_~j~0 9) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22391#(< (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,262 INFO L290 TraceCheckUtils]: 54: Hoare triple {22391#(< (+ main_~j~0 9) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22391#(< (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,262 INFO L290 TraceCheckUtils]: 53: Hoare triple {22401#(< (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22391#(< (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,263 INFO L290 TraceCheckUtils]: 52: Hoare triple {22401#(< (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22401#(< (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,263 INFO L290 TraceCheckUtils]: 51: Hoare triple {22401#(< (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22401#(< (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,263 INFO L290 TraceCheckUtils]: 50: Hoare triple {22411#(< (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22401#(< (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,263 INFO L290 TraceCheckUtils]: 49: Hoare triple {22411#(< (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22411#(< (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,264 INFO L290 TraceCheckUtils]: 48: Hoare triple {22411#(< (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22411#(< (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,264 INFO L290 TraceCheckUtils]: 47: Hoare triple {22421#(< (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22411#(< (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,264 INFO L290 TraceCheckUtils]: 46: Hoare triple {22421#(< (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22421#(< (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,265 INFO L290 TraceCheckUtils]: 45: Hoare triple {22421#(< (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22421#(< (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {22431#(< (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22421#(< (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {22431#(< (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22431#(< (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {22431#(< (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22431#(< (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,266 INFO L290 TraceCheckUtils]: 41: Hoare triple {22441#(< (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22431#(< (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,266 INFO L290 TraceCheckUtils]: 40: Hoare triple {22441#(< (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22441#(< (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,266 INFO L290 TraceCheckUtils]: 39: Hoare triple {22441#(< (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22441#(< (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,267 INFO L290 TraceCheckUtils]: 38: Hoare triple {22451#(< (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22441#(< (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,267 INFO L290 TraceCheckUtils]: 37: Hoare triple {22451#(< (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22451#(< (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {22451#(< (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22451#(< (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {22461#(< (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22451#(< (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {22461#(< (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22461#(< (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {22461#(< (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22461#(< (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {22471#(< (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22461#(< (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {22471#(< (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22471#(< (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,270 INFO L290 TraceCheckUtils]: 30: Hoare triple {22471#(< (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22471#(< (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {22481#(< (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22471#(< (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {22481#(< (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22481#(< (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {22481#(< (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22481#(< (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {22491#(< (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22481#(< (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {22491#(< (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22491#(< (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {22491#(< (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22491#(< (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {22491#(< (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-08 03:35:47,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {21980#(<= 20 main_~edgecount~0)} ~i~0 := 0; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {21935#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:47,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {21935#true} call #t~ret22 := main(); {21935#true} is VALID [2022-04-08 03:35:47,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21935#true} {21935#true} #107#return; {21935#true} is VALID [2022-04-08 03:35:47,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {21935#true} assume true; {21935#true} is VALID [2022-04-08 03:35:47,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {21935#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {21935#true} is VALID [2022-04-08 03:35:47,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {21935#true} call ULTIMATE.init(); {21935#true} is VALID [2022-04-08 03:35:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 1 proven. 532 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:35:47,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596807354] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:47,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:47,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 65 [2022-04-08 03:35:47,278 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:47,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127331927] [2022-04-08 03:35:47,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127331927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:47,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:47,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 03:35:47,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502317825] [2022-04-08 03:35:47,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:47,279 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-04-08 03:35:47,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:47,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:47,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:47,335 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 03:35:47,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:47,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 03:35:47,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1388, Invalid=2772, Unknown=0, NotChecked=0, Total=4160 [2022-04-08 03:35:47,337 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. Second operand has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:48,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:48,369 INFO L93 Difference]: Finished difference Result 179 states and 227 transitions. [2022-04-08 03:35:48,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 03:35:48,369 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-04-08 03:35:48,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 138 transitions. [2022-04-08 03:35:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 138 transitions. [2022-04-08 03:35:48,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 138 transitions. [2022-04-08 03:35:48,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:48,470 INFO L225 Difference]: With dead ends: 179 [2022-04-08 03:35:48,470 INFO L226 Difference]: Without dead ends: 103 [2022-04-08 03:35:48,472 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2481 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2333, Invalid=4977, Unknown=0, NotChecked=0, Total=7310 [2022-04-08 03:35:48,472 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 184 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:48,472 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 60 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:35:48,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-08 03:35:48,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-08 03:35:48,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:48,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:48,718 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:48,718 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:48,720 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-04-08 03:35:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-08 03:35:48,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:48,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:48,726 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 103 states. [2022-04-08 03:35:48,726 INFO L87 Difference]: Start difference. First operand has 103 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 103 states. [2022-04-08 03:35:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:48,727 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-04-08 03:35:48,727 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-08 03:35:48,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:48,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:48,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:48,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2022-04-08 03:35:48,729 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 95 [2022-04-08 03:35:48,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:48,729 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2022-04-08 03:35:48,729 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:48,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 128 transitions. [2022-04-08 03:35:48,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:48,914 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-08 03:35:48,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-08 03:35:48,914 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:48,915 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 20, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:48,932 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-08 03:35:49,115 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-08 03:35:49,115 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:49,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:49,115 INFO L85 PathProgramCache]: Analyzing trace with hash 6650394, now seen corresponding path program 45 times [2022-04-08 03:35:49,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:49,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [585688946] [2022-04-08 03:35:49,118 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:49,118 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:49,118 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:49,118 INFO L85 PathProgramCache]: Analyzing trace with hash 6650394, now seen corresponding path program 46 times [2022-04-08 03:35:49,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:49,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583737863] [2022-04-08 03:35:49,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:49,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:49,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:49,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {23392#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {23384#true} is VALID [2022-04-08 03:35:49,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {23384#true} assume true; {23384#true} is VALID [2022-04-08 03:35:49,199 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23384#true} {23384#true} #107#return; {23384#true} is VALID [2022-04-08 03:35:49,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {23384#true} call ULTIMATE.init(); {23392#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:49,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {23392#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {23384#true} is VALID [2022-04-08 03:35:49,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {23384#true} assume true; {23384#true} is VALID [2022-04-08 03:35:49,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23384#true} {23384#true} #107#return; {23384#true} is VALID [2022-04-08 03:35:49,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {23384#true} call #t~ret22 := main(); {23384#true} is VALID [2022-04-08 03:35:49,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {23384#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:49,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:49,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:49,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:49,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:49,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:49,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:49,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:49,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:49,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:49,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:49,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:49,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:49,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:49,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:49,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:49,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 < ~nodecount~0); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:49,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} ~i~0 := 0; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,211 INFO L290 TraceCheckUtils]: 39: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,211 INFO L290 TraceCheckUtils]: 40: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,213 INFO L290 TraceCheckUtils]: 45: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,213 INFO L290 TraceCheckUtils]: 46: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,215 INFO L290 TraceCheckUtils]: 49: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,215 INFO L290 TraceCheckUtils]: 50: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,215 INFO L290 TraceCheckUtils]: 51: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,216 INFO L290 TraceCheckUtils]: 52: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,216 INFO L290 TraceCheckUtils]: 53: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,216 INFO L290 TraceCheckUtils]: 54: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,217 INFO L290 TraceCheckUtils]: 55: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,217 INFO L290 TraceCheckUtils]: 56: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,217 INFO L290 TraceCheckUtils]: 57: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,218 INFO L290 TraceCheckUtils]: 58: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,218 INFO L290 TraceCheckUtils]: 59: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,219 INFO L290 TraceCheckUtils]: 60: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,219 INFO L290 TraceCheckUtils]: 61: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,219 INFO L290 TraceCheckUtils]: 62: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,220 INFO L290 TraceCheckUtils]: 63: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,220 INFO L290 TraceCheckUtils]: 64: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,220 INFO L290 TraceCheckUtils]: 65: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,221 INFO L290 TraceCheckUtils]: 66: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,221 INFO L290 TraceCheckUtils]: 67: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,221 INFO L290 TraceCheckUtils]: 68: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,222 INFO L290 TraceCheckUtils]: 69: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,222 INFO L290 TraceCheckUtils]: 70: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,223 INFO L290 TraceCheckUtils]: 71: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,223 INFO L290 TraceCheckUtils]: 72: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,223 INFO L290 TraceCheckUtils]: 73: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,224 INFO L290 TraceCheckUtils]: 74: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,224 INFO L290 TraceCheckUtils]: 75: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,224 INFO L290 TraceCheckUtils]: 76: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,225 INFO L290 TraceCheckUtils]: 77: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,225 INFO L290 TraceCheckUtils]: 78: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,226 INFO L290 TraceCheckUtils]: 79: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,226 INFO L290 TraceCheckUtils]: 80: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,226 INFO L290 TraceCheckUtils]: 81: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,227 INFO L290 TraceCheckUtils]: 82: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,227 INFO L290 TraceCheckUtils]: 83: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,227 INFO L290 TraceCheckUtils]: 84: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:49,228 INFO L290 TraceCheckUtils]: 85: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {23391#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:49,228 INFO L290 TraceCheckUtils]: 86: Hoare triple {23391#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 < ~nodecount~0); {23385#false} is VALID [2022-04-08 03:35:49,228 INFO L290 TraceCheckUtils]: 87: Hoare triple {23385#false} ~i~0 := 0; {23385#false} is VALID [2022-04-08 03:35:49,228 INFO L290 TraceCheckUtils]: 88: Hoare triple {23385#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {23385#false} is VALID [2022-04-08 03:35:49,228 INFO L290 TraceCheckUtils]: 89: Hoare triple {23385#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {23385#false} is VALID [2022-04-08 03:35:49,228 INFO L290 TraceCheckUtils]: 90: Hoare triple {23385#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {23385#false} is VALID [2022-04-08 03:35:49,228 INFO L290 TraceCheckUtils]: 91: Hoare triple {23385#false} assume !(~i~0 < ~edgecount~0); {23385#false} is VALID [2022-04-08 03:35:49,228 INFO L290 TraceCheckUtils]: 92: Hoare triple {23385#false} ~i~0 := 0; {23385#false} is VALID [2022-04-08 03:35:49,228 INFO L290 TraceCheckUtils]: 93: Hoare triple {23385#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23385#false} is VALID [2022-04-08 03:35:49,228 INFO L272 TraceCheckUtils]: 94: Hoare triple {23385#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {23385#false} is VALID [2022-04-08 03:35:49,228 INFO L290 TraceCheckUtils]: 95: Hoare triple {23385#false} ~cond := #in~cond; {23385#false} is VALID [2022-04-08 03:35:49,228 INFO L290 TraceCheckUtils]: 96: Hoare triple {23385#false} assume 0 == ~cond; {23385#false} is VALID [2022-04-08 03:35:49,229 INFO L290 TraceCheckUtils]: 97: Hoare triple {23385#false} assume !false; {23385#false} is VALID [2022-04-08 03:35:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2022-04-08 03:35:49,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:49,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583737863] [2022-04-08 03:35:49,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583737863] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:49,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822859469] [2022-04-08 03:35:49,229 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:35:49,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:49,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:49,230 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:49,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-08 03:35:49,401 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:35:49,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:49,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 03:35:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:49,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:50,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {23384#true} call ULTIMATE.init(); {23384#true} is VALID [2022-04-08 03:35:50,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {23384#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {23384#true} is VALID [2022-04-08 03:35:50,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {23384#true} assume true; {23384#true} is VALID [2022-04-08 03:35:50,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23384#true} {23384#true} #107#return; {23384#true} is VALID [2022-04-08 03:35:50,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {23384#true} call #t~ret22 := main(); {23384#true} is VALID [2022-04-08 03:35:50,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {23384#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {23384#true} is VALID [2022-04-08 03:35:50,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 03:35:50,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {23384#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 03:35:50,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 03:35:50,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 03:35:50,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 03:35:50,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 03:35:50,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 03:35:50,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 03:35:50,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 03:35:50,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 03:35:50,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 03:35:50,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 03:35:50,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 03:35:50,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 03:35:50,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 03:35:50,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {23384#true} assume !(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 03:35:50,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {23384#true} ~i~0 := 0; {23384#true} is VALID [2022-04-08 03:35:50,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {23465#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:50,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {23465#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23465#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:50,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {23465#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23465#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:50,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {23465#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23475#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:50,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {23475#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23475#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:50,037 INFO L290 TraceCheckUtils]: 28: Hoare triple {23475#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23475#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:50,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {23475#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23485#(<= 2 main_~j~0)} is VALID [2022-04-08 03:35:50,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {23485#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23485#(<= 2 main_~j~0)} is VALID [2022-04-08 03:35:50,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {23485#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23485#(<= 2 main_~j~0)} is VALID [2022-04-08 03:35:50,038 INFO L290 TraceCheckUtils]: 32: Hoare triple {23485#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23495#(<= 3 main_~j~0)} is VALID [2022-04-08 03:35:50,038 INFO L290 TraceCheckUtils]: 33: Hoare triple {23495#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23495#(<= 3 main_~j~0)} is VALID [2022-04-08 03:35:50,039 INFO L290 TraceCheckUtils]: 34: Hoare triple {23495#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23495#(<= 3 main_~j~0)} is VALID [2022-04-08 03:35:50,039 INFO L290 TraceCheckUtils]: 35: Hoare triple {23495#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23505#(<= 4 main_~j~0)} is VALID [2022-04-08 03:35:50,039 INFO L290 TraceCheckUtils]: 36: Hoare triple {23505#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23505#(<= 4 main_~j~0)} is VALID [2022-04-08 03:35:50,040 INFO L290 TraceCheckUtils]: 37: Hoare triple {23505#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23505#(<= 4 main_~j~0)} is VALID [2022-04-08 03:35:50,040 INFO L290 TraceCheckUtils]: 38: Hoare triple {23505#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23515#(<= 5 main_~j~0)} is VALID [2022-04-08 03:35:50,040 INFO L290 TraceCheckUtils]: 39: Hoare triple {23515#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23515#(<= 5 main_~j~0)} is VALID [2022-04-08 03:35:50,040 INFO L290 TraceCheckUtils]: 40: Hoare triple {23515#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23515#(<= 5 main_~j~0)} is VALID [2022-04-08 03:35:50,041 INFO L290 TraceCheckUtils]: 41: Hoare triple {23515#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23525#(<= 6 main_~j~0)} is VALID [2022-04-08 03:35:50,041 INFO L290 TraceCheckUtils]: 42: Hoare triple {23525#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23525#(<= 6 main_~j~0)} is VALID [2022-04-08 03:35:50,041 INFO L290 TraceCheckUtils]: 43: Hoare triple {23525#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23525#(<= 6 main_~j~0)} is VALID [2022-04-08 03:35:50,041 INFO L290 TraceCheckUtils]: 44: Hoare triple {23525#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23535#(<= 7 main_~j~0)} is VALID [2022-04-08 03:35:50,042 INFO L290 TraceCheckUtils]: 45: Hoare triple {23535#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23535#(<= 7 main_~j~0)} is VALID [2022-04-08 03:35:50,042 INFO L290 TraceCheckUtils]: 46: Hoare triple {23535#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23535#(<= 7 main_~j~0)} is VALID [2022-04-08 03:35:50,042 INFO L290 TraceCheckUtils]: 47: Hoare triple {23535#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23545#(<= 8 main_~j~0)} is VALID [2022-04-08 03:35:50,043 INFO L290 TraceCheckUtils]: 48: Hoare triple {23545#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23545#(<= 8 main_~j~0)} is VALID [2022-04-08 03:35:50,043 INFO L290 TraceCheckUtils]: 49: Hoare triple {23545#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23545#(<= 8 main_~j~0)} is VALID [2022-04-08 03:35:50,043 INFO L290 TraceCheckUtils]: 50: Hoare triple {23545#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23555#(<= 9 main_~j~0)} is VALID [2022-04-08 03:35:50,043 INFO L290 TraceCheckUtils]: 51: Hoare triple {23555#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23555#(<= 9 main_~j~0)} is VALID [2022-04-08 03:35:50,044 INFO L290 TraceCheckUtils]: 52: Hoare triple {23555#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23555#(<= 9 main_~j~0)} is VALID [2022-04-08 03:35:50,044 INFO L290 TraceCheckUtils]: 53: Hoare triple {23555#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23565#(<= 10 main_~j~0)} is VALID [2022-04-08 03:35:50,044 INFO L290 TraceCheckUtils]: 54: Hoare triple {23565#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23565#(<= 10 main_~j~0)} is VALID [2022-04-08 03:35:50,044 INFO L290 TraceCheckUtils]: 55: Hoare triple {23565#(<= 10 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23565#(<= 10 main_~j~0)} is VALID [2022-04-08 03:35:50,045 INFO L290 TraceCheckUtils]: 56: Hoare triple {23565#(<= 10 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23575#(<= 11 main_~j~0)} is VALID [2022-04-08 03:35:50,045 INFO L290 TraceCheckUtils]: 57: Hoare triple {23575#(<= 11 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23575#(<= 11 main_~j~0)} is VALID [2022-04-08 03:35:50,045 INFO L290 TraceCheckUtils]: 58: Hoare triple {23575#(<= 11 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23575#(<= 11 main_~j~0)} is VALID [2022-04-08 03:35:50,045 INFO L290 TraceCheckUtils]: 59: Hoare triple {23575#(<= 11 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23585#(<= 12 main_~j~0)} is VALID [2022-04-08 03:35:50,046 INFO L290 TraceCheckUtils]: 60: Hoare triple {23585#(<= 12 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23585#(<= 12 main_~j~0)} is VALID [2022-04-08 03:35:50,046 INFO L290 TraceCheckUtils]: 61: Hoare triple {23585#(<= 12 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23585#(<= 12 main_~j~0)} is VALID [2022-04-08 03:35:50,046 INFO L290 TraceCheckUtils]: 62: Hoare triple {23585#(<= 12 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23595#(<= 13 main_~j~0)} is VALID [2022-04-08 03:35:50,047 INFO L290 TraceCheckUtils]: 63: Hoare triple {23595#(<= 13 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23595#(<= 13 main_~j~0)} is VALID [2022-04-08 03:35:50,047 INFO L290 TraceCheckUtils]: 64: Hoare triple {23595#(<= 13 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23595#(<= 13 main_~j~0)} is VALID [2022-04-08 03:35:50,047 INFO L290 TraceCheckUtils]: 65: Hoare triple {23595#(<= 13 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23605#(<= 14 main_~j~0)} is VALID [2022-04-08 03:35:50,047 INFO L290 TraceCheckUtils]: 66: Hoare triple {23605#(<= 14 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23605#(<= 14 main_~j~0)} is VALID [2022-04-08 03:35:50,048 INFO L290 TraceCheckUtils]: 67: Hoare triple {23605#(<= 14 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23605#(<= 14 main_~j~0)} is VALID [2022-04-08 03:35:50,048 INFO L290 TraceCheckUtils]: 68: Hoare triple {23605#(<= 14 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23615#(<= 15 main_~j~0)} is VALID [2022-04-08 03:35:50,048 INFO L290 TraceCheckUtils]: 69: Hoare triple {23615#(<= 15 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23615#(<= 15 main_~j~0)} is VALID [2022-04-08 03:35:50,048 INFO L290 TraceCheckUtils]: 70: Hoare triple {23615#(<= 15 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23615#(<= 15 main_~j~0)} is VALID [2022-04-08 03:35:50,049 INFO L290 TraceCheckUtils]: 71: Hoare triple {23615#(<= 15 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23625#(<= 16 main_~j~0)} is VALID [2022-04-08 03:35:50,049 INFO L290 TraceCheckUtils]: 72: Hoare triple {23625#(<= 16 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23625#(<= 16 main_~j~0)} is VALID [2022-04-08 03:35:50,049 INFO L290 TraceCheckUtils]: 73: Hoare triple {23625#(<= 16 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23625#(<= 16 main_~j~0)} is VALID [2022-04-08 03:35:50,050 INFO L290 TraceCheckUtils]: 74: Hoare triple {23625#(<= 16 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23635#(<= 17 main_~j~0)} is VALID [2022-04-08 03:35:50,050 INFO L290 TraceCheckUtils]: 75: Hoare triple {23635#(<= 17 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23635#(<= 17 main_~j~0)} is VALID [2022-04-08 03:35:50,050 INFO L290 TraceCheckUtils]: 76: Hoare triple {23635#(<= 17 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23635#(<= 17 main_~j~0)} is VALID [2022-04-08 03:35:50,050 INFO L290 TraceCheckUtils]: 77: Hoare triple {23635#(<= 17 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23645#(<= 18 main_~j~0)} is VALID [2022-04-08 03:35:50,051 INFO L290 TraceCheckUtils]: 78: Hoare triple {23645#(<= 18 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23645#(<= 18 main_~j~0)} is VALID [2022-04-08 03:35:50,051 INFO L290 TraceCheckUtils]: 79: Hoare triple {23645#(<= 18 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23645#(<= 18 main_~j~0)} is VALID [2022-04-08 03:35:50,051 INFO L290 TraceCheckUtils]: 80: Hoare triple {23645#(<= 18 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23655#(<= 19 main_~j~0)} is VALID [2022-04-08 03:35:50,052 INFO L290 TraceCheckUtils]: 81: Hoare triple {23655#(<= 19 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23659#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:35:50,052 INFO L290 TraceCheckUtils]: 82: Hoare triple {23659#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23659#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:35:50,052 INFO L290 TraceCheckUtils]: 83: Hoare triple {23659#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23659#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:35:50,052 INFO L290 TraceCheckUtils]: 84: Hoare triple {23659#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {23659#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:35:50,053 INFO L290 TraceCheckUtils]: 85: Hoare triple {23659#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {23659#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:35:50,053 INFO L290 TraceCheckUtils]: 86: Hoare triple {23659#(< 19 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {23659#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:35:50,053 INFO L290 TraceCheckUtils]: 87: Hoare triple {23659#(< 19 main_~edgecount~0)} ~i~0 := 0; {23678#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 03:35:50,054 INFO L290 TraceCheckUtils]: 88: Hoare triple {23678#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {23678#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 03:35:50,054 INFO L290 TraceCheckUtils]: 89: Hoare triple {23678#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {23678#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 03:35:50,054 INFO L290 TraceCheckUtils]: 90: Hoare triple {23678#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {23688#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 03:35:50,055 INFO L290 TraceCheckUtils]: 91: Hoare triple {23688#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~edgecount~0); {23385#false} is VALID [2022-04-08 03:35:50,055 INFO L290 TraceCheckUtils]: 92: Hoare triple {23385#false} ~i~0 := 0; {23385#false} is VALID [2022-04-08 03:35:50,055 INFO L290 TraceCheckUtils]: 93: Hoare triple {23385#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23385#false} is VALID [2022-04-08 03:35:50,055 INFO L272 TraceCheckUtils]: 94: Hoare triple {23385#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {23385#false} is VALID [2022-04-08 03:35:50,055 INFO L290 TraceCheckUtils]: 95: Hoare triple {23385#false} ~cond := #in~cond; {23385#false} is VALID [2022-04-08 03:35:50,055 INFO L290 TraceCheckUtils]: 96: Hoare triple {23385#false} assume 0 == ~cond; {23385#false} is VALID [2022-04-08 03:35:50,055 INFO L290 TraceCheckUtils]: 97: Hoare triple {23385#false} assume !false; {23385#false} is VALID [2022-04-08 03:35:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 533 proven. 59 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 03:35:50,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:50,659 INFO L290 TraceCheckUtils]: 97: Hoare triple {23385#false} assume !false; {23385#false} is VALID [2022-04-08 03:35:50,659 INFO L290 TraceCheckUtils]: 96: Hoare triple {23385#false} assume 0 == ~cond; {23385#false} is VALID [2022-04-08 03:35:50,659 INFO L290 TraceCheckUtils]: 95: Hoare triple {23385#false} ~cond := #in~cond; {23385#false} is VALID [2022-04-08 03:35:50,659 INFO L272 TraceCheckUtils]: 94: Hoare triple {23385#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {23385#false} is VALID [2022-04-08 03:35:50,659 INFO L290 TraceCheckUtils]: 93: Hoare triple {23385#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23385#false} is VALID [2022-04-08 03:35:50,659 INFO L290 TraceCheckUtils]: 92: Hoare triple {23385#false} ~i~0 := 0; {23385#false} is VALID [2022-04-08 03:35:50,659 INFO L290 TraceCheckUtils]: 91: Hoare triple {23728#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {23385#false} is VALID [2022-04-08 03:35:50,660 INFO L290 TraceCheckUtils]: 90: Hoare triple {23732#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {23728#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:35:50,660 INFO L290 TraceCheckUtils]: 89: Hoare triple {23732#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {23732#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:50,661 INFO L290 TraceCheckUtils]: 88: Hoare triple {23732#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {23732#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:50,661 INFO L290 TraceCheckUtils]: 87: Hoare triple {23742#(< 1 main_~edgecount~0)} ~i~0 := 0; {23732#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:50,661 INFO L290 TraceCheckUtils]: 86: Hoare triple {23742#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {23742#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:50,661 INFO L290 TraceCheckUtils]: 85: Hoare triple {23742#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {23742#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:50,662 INFO L290 TraceCheckUtils]: 84: Hoare triple {23742#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {23742#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:50,662 INFO L290 TraceCheckUtils]: 83: Hoare triple {23742#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23742#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:50,662 INFO L290 TraceCheckUtils]: 82: Hoare triple {23742#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23742#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:50,663 INFO L290 TraceCheckUtils]: 81: Hoare triple {23475#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23742#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:50,663 INFO L290 TraceCheckUtils]: 80: Hoare triple {23465#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23475#(<= 1 main_~j~0)} is VALID [2022-04-08 03:35:50,664 INFO L290 TraceCheckUtils]: 79: Hoare triple {23465#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23465#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:50,664 INFO L290 TraceCheckUtils]: 78: Hoare triple {23465#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23465#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:50,664 INFO L290 TraceCheckUtils]: 77: Hoare triple {23773#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23465#(<= 0 main_~j~0)} is VALID [2022-04-08 03:35:50,665 INFO L290 TraceCheckUtils]: 76: Hoare triple {23773#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23773#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:35:50,665 INFO L290 TraceCheckUtils]: 75: Hoare triple {23773#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23773#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:35:50,665 INFO L290 TraceCheckUtils]: 74: Hoare triple {23783#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23773#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:35:50,666 INFO L290 TraceCheckUtils]: 73: Hoare triple {23783#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23783#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:35:50,666 INFO L290 TraceCheckUtils]: 72: Hoare triple {23783#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23783#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:35:50,666 INFO L290 TraceCheckUtils]: 71: Hoare triple {23793#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23783#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:35:50,667 INFO L290 TraceCheckUtils]: 70: Hoare triple {23793#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23793#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:35:50,667 INFO L290 TraceCheckUtils]: 69: Hoare triple {23793#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23793#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:35:50,668 INFO L290 TraceCheckUtils]: 68: Hoare triple {23803#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23793#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:35:50,668 INFO L290 TraceCheckUtils]: 67: Hoare triple {23803#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23803#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:35:50,668 INFO L290 TraceCheckUtils]: 66: Hoare triple {23803#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23803#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:35:50,668 INFO L290 TraceCheckUtils]: 65: Hoare triple {23813#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23803#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:35:50,669 INFO L290 TraceCheckUtils]: 64: Hoare triple {23813#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23813#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:35:50,669 INFO L290 TraceCheckUtils]: 63: Hoare triple {23813#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23813#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:35:50,669 INFO L290 TraceCheckUtils]: 62: Hoare triple {23823#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23813#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:35:50,670 INFO L290 TraceCheckUtils]: 61: Hoare triple {23823#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23823#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:35:50,670 INFO L290 TraceCheckUtils]: 60: Hoare triple {23823#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23823#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:35:50,670 INFO L290 TraceCheckUtils]: 59: Hoare triple {23833#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23823#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:35:50,671 INFO L290 TraceCheckUtils]: 58: Hoare triple {23833#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23833#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:35:50,671 INFO L290 TraceCheckUtils]: 57: Hoare triple {23833#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23833#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:35:50,671 INFO L290 TraceCheckUtils]: 56: Hoare triple {23843#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23833#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:35:50,672 INFO L290 TraceCheckUtils]: 55: Hoare triple {23843#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23843#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:35:50,672 INFO L290 TraceCheckUtils]: 54: Hoare triple {23843#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23843#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:35:50,672 INFO L290 TraceCheckUtils]: 53: Hoare triple {23853#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23843#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:35:50,673 INFO L290 TraceCheckUtils]: 52: Hoare triple {23853#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23853#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:35:50,673 INFO L290 TraceCheckUtils]: 51: Hoare triple {23853#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23853#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:35:50,673 INFO L290 TraceCheckUtils]: 50: Hoare triple {23863#(<= 0 (+ main_~j~0 10))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23853#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:35:50,674 INFO L290 TraceCheckUtils]: 49: Hoare triple {23863#(<= 0 (+ main_~j~0 10))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23863#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 03:35:50,674 INFO L290 TraceCheckUtils]: 48: Hoare triple {23863#(<= 0 (+ main_~j~0 10))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23863#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 03:35:50,674 INFO L290 TraceCheckUtils]: 47: Hoare triple {23873#(<= 0 (+ main_~j~0 11))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23863#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 03:35:50,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {23873#(<= 0 (+ main_~j~0 11))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23873#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 03:35:50,675 INFO L290 TraceCheckUtils]: 45: Hoare triple {23873#(<= 0 (+ main_~j~0 11))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23873#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 03:35:50,675 INFO L290 TraceCheckUtils]: 44: Hoare triple {23883#(<= 0 (+ main_~j~0 12))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23873#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 03:35:50,675 INFO L290 TraceCheckUtils]: 43: Hoare triple {23883#(<= 0 (+ main_~j~0 12))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23883#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 03:35:50,675 INFO L290 TraceCheckUtils]: 42: Hoare triple {23883#(<= 0 (+ main_~j~0 12))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23883#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 03:35:50,676 INFO L290 TraceCheckUtils]: 41: Hoare triple {23893#(<= 0 (+ main_~j~0 13))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23883#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 03:35:50,676 INFO L290 TraceCheckUtils]: 40: Hoare triple {23893#(<= 0 (+ main_~j~0 13))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23893#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 03:35:50,676 INFO L290 TraceCheckUtils]: 39: Hoare triple {23893#(<= 0 (+ main_~j~0 13))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23893#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 03:35:50,677 INFO L290 TraceCheckUtils]: 38: Hoare triple {23903#(<= 0 (+ main_~j~0 14))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23893#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 03:35:50,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {23903#(<= 0 (+ main_~j~0 14))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23903#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 03:35:50,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {23903#(<= 0 (+ main_~j~0 14))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23903#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 03:35:50,678 INFO L290 TraceCheckUtils]: 35: Hoare triple {23913#(<= 0 (+ main_~j~0 15))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23903#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 03:35:50,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {23913#(<= 0 (+ main_~j~0 15))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23913#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 03:35:50,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {23913#(<= 0 (+ main_~j~0 15))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23913#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 03:35:50,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {23923#(<= 0 (+ main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23913#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 03:35:50,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {23923#(<= 0 (+ main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23923#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-08 03:35:50,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {23923#(<= 0 (+ main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23923#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-08 03:35:50,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {23933#(<= 0 (+ main_~j~0 17))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23923#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-08 03:35:50,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {23933#(<= 0 (+ main_~j~0 17))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23933#(<= 0 (+ main_~j~0 17))} is VALID [2022-04-08 03:35:50,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {23933#(<= 0 (+ main_~j~0 17))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23933#(<= 0 (+ main_~j~0 17))} is VALID [2022-04-08 03:35:50,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {23943#(<= 0 (+ main_~j~0 18))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23933#(<= 0 (+ main_~j~0 17))} is VALID [2022-04-08 03:35:50,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {23943#(<= 0 (+ main_~j~0 18))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23943#(<= 0 (+ main_~j~0 18))} is VALID [2022-04-08 03:35:50,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {23943#(<= 0 (+ main_~j~0 18))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23943#(<= 0 (+ main_~j~0 18))} is VALID [2022-04-08 03:35:50,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {23943#(<= 0 (+ main_~j~0 18))} is VALID [2022-04-08 03:35:50,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {23384#true} ~i~0 := 0; {23384#true} is VALID [2022-04-08 03:35:50,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {23384#true} assume !(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 03:35:50,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 03:35:50,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 03:35:50,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 03:35:50,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 03:35:50,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 03:35:50,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 03:35:50,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 03:35:50,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 03:35:50,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 03:35:50,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 03:35:50,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 03:35:50,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 03:35:50,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-08 03:35:50,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {23384#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-08 03:35:50,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-08 03:35:50,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {23384#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {23384#true} is VALID [2022-04-08 03:35:50,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {23384#true} call #t~ret22 := main(); {23384#true} is VALID [2022-04-08 03:35:50,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23384#true} {23384#true} #107#return; {23384#true} is VALID [2022-04-08 03:35:50,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {23384#true} assume true; {23384#true} is VALID [2022-04-08 03:35:50,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {23384#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {23384#true} is VALID [2022-04-08 03:35:50,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {23384#true} call ULTIMATE.init(); {23384#true} is VALID [2022-04-08 03:35:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 533 proven. 59 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-08 03:35:50,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822859469] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:50,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:50,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 25, 25] total 50 [2022-04-08 03:35:50,684 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:50,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [585688946] [2022-04-08 03:35:50,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [585688946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:50,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:50,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:35:50,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615586562] [2022-04-08 03:35:50,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:50,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-08 03:35:50,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:50,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:50,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:50,703 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:35:50,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:50,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:35:50,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=1636, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 03:35:50,704 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:51,622 INFO L93 Difference]: Finished difference Result 258 states and 330 transitions. [2022-04-08 03:35:51,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:35:51,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-08 03:35:51,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-04-08 03:35:51,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-04-08 03:35:51,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 91 transitions. [2022-04-08 03:35:51,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:51,700 INFO L225 Difference]: With dead ends: 258 [2022-04-08 03:35:51,700 INFO L226 Difference]: Without dead ends: 242 [2022-04-08 03:35:51,700 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=832, Invalid=1924, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 03:35:51,701 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 113 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:51,701 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 34 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:51,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-04-08 03:35:52,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 166. [2022-04-08 03:35:52,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:52,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand has 166 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:52,194 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand has 166 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:52,194 INFO L87 Difference]: Start difference. First operand 242 states. Second operand has 166 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:52,200 INFO L93 Difference]: Finished difference Result 242 states and 312 transitions. [2022-04-08 03:35:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 312 transitions. [2022-04-08 03:35:52,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:52,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:52,201 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 242 states. [2022-04-08 03:35:52,201 INFO L87 Difference]: Start difference. First operand has 166 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 242 states. [2022-04-08 03:35:52,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:52,205 INFO L93 Difference]: Finished difference Result 242 states and 312 transitions. [2022-04-08 03:35:52,205 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 312 transitions. [2022-04-08 03:35:52,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:52,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:52,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:52,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 212 transitions. [2022-04-08 03:35:52,209 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 212 transitions. Word has length 98 [2022-04-08 03:35:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:52,209 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 212 transitions. [2022-04-08 03:35:52,210 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:52,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 212 transitions. [2022-04-08 03:35:52,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 212 transitions. [2022-04-08 03:35:52,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-08 03:35:52,566 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:52,566 INFO L499 BasicCegarLoop]: trace histogram [40, 40, 40, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:52,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:52,766 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:52,766 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:52,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:52,767 INFO L85 PathProgramCache]: Analyzing trace with hash 576417944, now seen corresponding path program 47 times [2022-04-08 03:35:52,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:52,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [36600537] [2022-04-08 03:35:52,769 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:52,770 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:52,770 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:52,770 INFO L85 PathProgramCache]: Analyzing trace with hash 576417944, now seen corresponding path program 48 times [2022-04-08 03:35:52,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:52,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738644792] [2022-04-08 03:35:52,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:52,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:52,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:52,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {25371#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {25362#true} is VALID [2022-04-08 03:35:52,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {25362#true} assume true; {25362#true} is VALID [2022-04-08 03:35:52,920 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25362#true} {25362#true} #107#return; {25362#true} is VALID [2022-04-08 03:35:52,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {25362#true} call ULTIMATE.init(); {25371#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:52,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {25371#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {25362#true} is VALID [2022-04-08 03:35:52,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {25362#true} assume true; {25362#true} is VALID [2022-04-08 03:35:52,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25362#true} {25362#true} #107#return; {25362#true} is VALID [2022-04-08 03:35:52,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {25362#true} call #t~ret22 := main(); {25362#true} is VALID [2022-04-08 03:35:52,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {25362#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:52,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:52,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:52,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:52,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:52,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:52,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:52,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:52,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:52,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:52,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:52,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:52,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:52,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:52,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:52,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:52,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 < ~nodecount~0); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:52,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} ~i~0 := 0; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,926 INFO L290 TraceCheckUtils]: 23: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,929 INFO L290 TraceCheckUtils]: 32: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,931 INFO L290 TraceCheckUtils]: 35: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,932 INFO L290 TraceCheckUtils]: 39: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,932 INFO L290 TraceCheckUtils]: 40: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,935 INFO L290 TraceCheckUtils]: 46: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,935 INFO L290 TraceCheckUtils]: 47: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,935 INFO L290 TraceCheckUtils]: 48: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,936 INFO L290 TraceCheckUtils]: 50: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,936 INFO L290 TraceCheckUtils]: 51: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,937 INFO L290 TraceCheckUtils]: 52: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,937 INFO L290 TraceCheckUtils]: 53: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,937 INFO L290 TraceCheckUtils]: 54: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,938 INFO L290 TraceCheckUtils]: 55: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,938 INFO L290 TraceCheckUtils]: 56: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,938 INFO L290 TraceCheckUtils]: 57: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,939 INFO L290 TraceCheckUtils]: 58: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,939 INFO L290 TraceCheckUtils]: 59: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,939 INFO L290 TraceCheckUtils]: 60: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,940 INFO L290 TraceCheckUtils]: 61: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,940 INFO L290 TraceCheckUtils]: 62: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,941 INFO L290 TraceCheckUtils]: 63: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,941 INFO L290 TraceCheckUtils]: 64: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,941 INFO L290 TraceCheckUtils]: 65: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,942 INFO L290 TraceCheckUtils]: 66: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,942 INFO L290 TraceCheckUtils]: 67: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,942 INFO L290 TraceCheckUtils]: 68: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,943 INFO L290 TraceCheckUtils]: 69: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,943 INFO L290 TraceCheckUtils]: 70: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,943 INFO L290 TraceCheckUtils]: 71: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,944 INFO L290 TraceCheckUtils]: 72: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,944 INFO L290 TraceCheckUtils]: 73: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,944 INFO L290 TraceCheckUtils]: 74: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,945 INFO L290 TraceCheckUtils]: 75: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,945 INFO L290 TraceCheckUtils]: 76: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,946 INFO L290 TraceCheckUtils]: 77: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,947 INFO L290 TraceCheckUtils]: 78: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,947 INFO L290 TraceCheckUtils]: 79: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,947 INFO L290 TraceCheckUtils]: 80: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,948 INFO L290 TraceCheckUtils]: 81: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,948 INFO L290 TraceCheckUtils]: 82: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,949 INFO L290 TraceCheckUtils]: 83: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,949 INFO L290 TraceCheckUtils]: 84: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:52,949 INFO L290 TraceCheckUtils]: 85: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,949 INFO L290 TraceCheckUtils]: 86: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,950 INFO L290 TraceCheckUtils]: 87: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,950 INFO L290 TraceCheckUtils]: 88: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,950 INFO L290 TraceCheckUtils]: 89: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,951 INFO L290 TraceCheckUtils]: 90: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,951 INFO L290 TraceCheckUtils]: 91: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,951 INFO L290 TraceCheckUtils]: 92: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,952 INFO L290 TraceCheckUtils]: 93: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,952 INFO L290 TraceCheckUtils]: 94: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,953 INFO L290 TraceCheckUtils]: 95: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,953 INFO L290 TraceCheckUtils]: 96: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,953 INFO L290 TraceCheckUtils]: 97: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,954 INFO L290 TraceCheckUtils]: 98: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,954 INFO L290 TraceCheckUtils]: 99: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,954 INFO L290 TraceCheckUtils]: 100: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,955 INFO L290 TraceCheckUtils]: 101: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,955 INFO L290 TraceCheckUtils]: 102: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,956 INFO L290 TraceCheckUtils]: 103: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,956 INFO L290 TraceCheckUtils]: 104: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,956 INFO L290 TraceCheckUtils]: 105: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,957 INFO L290 TraceCheckUtils]: 106: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,957 INFO L290 TraceCheckUtils]: 107: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,957 INFO L290 TraceCheckUtils]: 108: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,958 INFO L290 TraceCheckUtils]: 109: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,958 INFO L290 TraceCheckUtils]: 110: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,958 INFO L290 TraceCheckUtils]: 111: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,959 INFO L290 TraceCheckUtils]: 112: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,959 INFO L290 TraceCheckUtils]: 113: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,959 INFO L290 TraceCheckUtils]: 114: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,960 INFO L290 TraceCheckUtils]: 115: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,960 INFO L290 TraceCheckUtils]: 116: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,960 INFO L290 TraceCheckUtils]: 117: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,961 INFO L290 TraceCheckUtils]: 118: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,961 INFO L290 TraceCheckUtils]: 119: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,961 INFO L290 TraceCheckUtils]: 120: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,962 INFO L290 TraceCheckUtils]: 121: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,962 INFO L290 TraceCheckUtils]: 122: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,962 INFO L290 TraceCheckUtils]: 123: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,963 INFO L290 TraceCheckUtils]: 124: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,963 INFO L290 TraceCheckUtils]: 125: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,964 INFO L290 TraceCheckUtils]: 126: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,964 INFO L290 TraceCheckUtils]: 127: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,964 INFO L290 TraceCheckUtils]: 128: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,965 INFO L290 TraceCheckUtils]: 129: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,965 INFO L290 TraceCheckUtils]: 130: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,965 INFO L290 TraceCheckUtils]: 131: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,966 INFO L290 TraceCheckUtils]: 132: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,966 INFO L290 TraceCheckUtils]: 133: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,966 INFO L290 TraceCheckUtils]: 134: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,967 INFO L290 TraceCheckUtils]: 135: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,967 INFO L290 TraceCheckUtils]: 136: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,967 INFO L290 TraceCheckUtils]: 137: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,968 INFO L290 TraceCheckUtils]: 138: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,968 INFO L290 TraceCheckUtils]: 139: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,968 INFO L290 TraceCheckUtils]: 140: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,969 INFO L290 TraceCheckUtils]: 141: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,969 INFO L290 TraceCheckUtils]: 142: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,969 INFO L290 TraceCheckUtils]: 143: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,970 INFO L290 TraceCheckUtils]: 144: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,970 INFO L290 TraceCheckUtils]: 145: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,971 INFO L290 TraceCheckUtils]: 146: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,971 INFO L290 TraceCheckUtils]: 147: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~j~0 < ~edgecount~0); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:52,971 INFO L290 TraceCheckUtils]: 148: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {25370#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:52,972 INFO L290 TraceCheckUtils]: 149: Hoare triple {25370#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~i~0 < ~nodecount~0); {25363#false} is VALID [2022-04-08 03:35:52,972 INFO L290 TraceCheckUtils]: 150: Hoare triple {25363#false} ~i~0 := 0; {25363#false} is VALID [2022-04-08 03:35:52,972 INFO L290 TraceCheckUtils]: 151: Hoare triple {25363#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {25363#false} is VALID [2022-04-08 03:35:52,972 INFO L290 TraceCheckUtils]: 152: Hoare triple {25363#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {25363#false} is VALID [2022-04-08 03:35:52,972 INFO L290 TraceCheckUtils]: 153: Hoare triple {25363#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {25363#false} is VALID [2022-04-08 03:35:52,972 INFO L290 TraceCheckUtils]: 154: Hoare triple {25363#false} assume !(~i~0 < ~edgecount~0); {25363#false} is VALID [2022-04-08 03:35:52,972 INFO L290 TraceCheckUtils]: 155: Hoare triple {25363#false} ~i~0 := 0; {25363#false} is VALID [2022-04-08 03:35:52,972 INFO L290 TraceCheckUtils]: 156: Hoare triple {25363#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25363#false} is VALID [2022-04-08 03:35:52,972 INFO L272 TraceCheckUtils]: 157: Hoare triple {25363#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {25363#false} is VALID [2022-04-08 03:35:52,972 INFO L290 TraceCheckUtils]: 158: Hoare triple {25363#false} ~cond := #in~cond; {25363#false} is VALID [2022-04-08 03:35:52,972 INFO L290 TraceCheckUtils]: 159: Hoare triple {25363#false} assume 0 == ~cond; {25363#false} is VALID [2022-04-08 03:35:52,972 INFO L290 TraceCheckUtils]: 160: Hoare triple {25363#false} assume !false; {25363#false} is VALID [2022-04-08 03:35:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 0 proven. 1245 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2022-04-08 03:35:52,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:52,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738644792] [2022-04-08 03:35:52,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738644792] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:52,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370212220] [2022-04-08 03:35:52,974 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:35:52,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:52,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:52,974 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:52,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-08 03:35:53,188 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 03:35:53,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:53,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 03:35:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:53,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:53,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {25362#true} call ULTIMATE.init(); {25362#true} is VALID [2022-04-08 03:35:53,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {25362#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {25362#true} is VALID [2022-04-08 03:35:53,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {25362#true} assume true; {25362#true} is VALID [2022-04-08 03:35:53,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25362#true} {25362#true} #107#return; {25362#true} is VALID [2022-04-08 03:35:53,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {25362#true} call #t~ret22 := main(); {25362#true} is VALID [2022-04-08 03:35:53,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {25362#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {25390#(<= 20 main_~edgecount~0)} ~i~0 := 0; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,771 INFO L290 TraceCheckUtils]: 34: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,773 INFO L290 TraceCheckUtils]: 44: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,773 INFO L290 TraceCheckUtils]: 45: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,774 INFO L290 TraceCheckUtils]: 47: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,774 INFO L290 TraceCheckUtils]: 49: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,775 INFO L290 TraceCheckUtils]: 50: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,775 INFO L290 TraceCheckUtils]: 51: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,775 INFO L290 TraceCheckUtils]: 52: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,775 INFO L290 TraceCheckUtils]: 53: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,775 INFO L290 TraceCheckUtils]: 54: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,776 INFO L290 TraceCheckUtils]: 55: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,776 INFO L290 TraceCheckUtils]: 56: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,776 INFO L290 TraceCheckUtils]: 57: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,776 INFO L290 TraceCheckUtils]: 58: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,777 INFO L290 TraceCheckUtils]: 59: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,777 INFO L290 TraceCheckUtils]: 60: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,777 INFO L290 TraceCheckUtils]: 61: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,777 INFO L290 TraceCheckUtils]: 62: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,778 INFO L290 TraceCheckUtils]: 63: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,778 INFO L290 TraceCheckUtils]: 64: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,778 INFO L290 TraceCheckUtils]: 65: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,778 INFO L290 TraceCheckUtils]: 66: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,779 INFO L290 TraceCheckUtils]: 67: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,779 INFO L290 TraceCheckUtils]: 68: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,779 INFO L290 TraceCheckUtils]: 69: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,779 INFO L290 TraceCheckUtils]: 70: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,780 INFO L290 TraceCheckUtils]: 71: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,780 INFO L290 TraceCheckUtils]: 72: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,780 INFO L290 TraceCheckUtils]: 73: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,780 INFO L290 TraceCheckUtils]: 74: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,781 INFO L290 TraceCheckUtils]: 75: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,781 INFO L290 TraceCheckUtils]: 76: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,781 INFO L290 TraceCheckUtils]: 77: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,781 INFO L290 TraceCheckUtils]: 78: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,781 INFO L290 TraceCheckUtils]: 79: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,782 INFO L290 TraceCheckUtils]: 80: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,782 INFO L290 TraceCheckUtils]: 81: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,782 INFO L290 TraceCheckUtils]: 82: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,782 INFO L290 TraceCheckUtils]: 83: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,783 INFO L290 TraceCheckUtils]: 84: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,783 INFO L290 TraceCheckUtils]: 85: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,783 INFO L290 TraceCheckUtils]: 86: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,783 INFO L290 TraceCheckUtils]: 87: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,784 INFO L290 TraceCheckUtils]: 88: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,784 INFO L290 TraceCheckUtils]: 89: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,784 INFO L290 TraceCheckUtils]: 90: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,784 INFO L290 TraceCheckUtils]: 91: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,785 INFO L290 TraceCheckUtils]: 92: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,785 INFO L290 TraceCheckUtils]: 93: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,785 INFO L290 TraceCheckUtils]: 94: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,785 INFO L290 TraceCheckUtils]: 95: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,786 INFO L290 TraceCheckUtils]: 96: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,786 INFO L290 TraceCheckUtils]: 97: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,786 INFO L290 TraceCheckUtils]: 98: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,786 INFO L290 TraceCheckUtils]: 99: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,786 INFO L290 TraceCheckUtils]: 100: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,787 INFO L290 TraceCheckUtils]: 101: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,787 INFO L290 TraceCheckUtils]: 102: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,787 INFO L290 TraceCheckUtils]: 103: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,787 INFO L290 TraceCheckUtils]: 104: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,788 INFO L290 TraceCheckUtils]: 105: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,788 INFO L290 TraceCheckUtils]: 106: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,788 INFO L290 TraceCheckUtils]: 107: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,788 INFO L290 TraceCheckUtils]: 108: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,789 INFO L290 TraceCheckUtils]: 109: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,789 INFO L290 TraceCheckUtils]: 110: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,789 INFO L290 TraceCheckUtils]: 111: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,789 INFO L290 TraceCheckUtils]: 112: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,790 INFO L290 TraceCheckUtils]: 113: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,790 INFO L290 TraceCheckUtils]: 114: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,790 INFO L290 TraceCheckUtils]: 115: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,790 INFO L290 TraceCheckUtils]: 116: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,791 INFO L290 TraceCheckUtils]: 117: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,791 INFO L290 TraceCheckUtils]: 118: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,791 INFO L290 TraceCheckUtils]: 119: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,791 INFO L290 TraceCheckUtils]: 120: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,792 INFO L290 TraceCheckUtils]: 121: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,792 INFO L290 TraceCheckUtils]: 122: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,792 INFO L290 TraceCheckUtils]: 123: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,792 INFO L290 TraceCheckUtils]: 124: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,792 INFO L290 TraceCheckUtils]: 125: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,793 INFO L290 TraceCheckUtils]: 126: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,793 INFO L290 TraceCheckUtils]: 127: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,793 INFO L290 TraceCheckUtils]: 128: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,793 INFO L290 TraceCheckUtils]: 129: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,794 INFO L290 TraceCheckUtils]: 130: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,794 INFO L290 TraceCheckUtils]: 131: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,794 INFO L290 TraceCheckUtils]: 132: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,795 INFO L290 TraceCheckUtils]: 133: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,796 INFO L290 TraceCheckUtils]: 134: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,796 INFO L290 TraceCheckUtils]: 135: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,797 INFO L290 TraceCheckUtils]: 136: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,797 INFO L290 TraceCheckUtils]: 137: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,798 INFO L290 TraceCheckUtils]: 138: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,798 INFO L290 TraceCheckUtils]: 139: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,798 INFO L290 TraceCheckUtils]: 140: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,798 INFO L290 TraceCheckUtils]: 141: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,799 INFO L290 TraceCheckUtils]: 142: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,799 INFO L290 TraceCheckUtils]: 143: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,799 INFO L290 TraceCheckUtils]: 144: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,799 INFO L290 TraceCheckUtils]: 145: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,800 INFO L290 TraceCheckUtils]: 146: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,800 INFO L290 TraceCheckUtils]: 147: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,800 INFO L290 TraceCheckUtils]: 148: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,800 INFO L290 TraceCheckUtils]: 149: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:35:53,801 INFO L290 TraceCheckUtils]: 150: Hoare triple {25390#(<= 20 main_~edgecount~0)} ~i~0 := 0; {25826#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:53,801 INFO L290 TraceCheckUtils]: 151: Hoare triple {25826#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {25826#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:53,802 INFO L290 TraceCheckUtils]: 152: Hoare triple {25826#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {25826#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:53,802 INFO L290 TraceCheckUtils]: 153: Hoare triple {25826#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {25836#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:35:53,802 INFO L290 TraceCheckUtils]: 154: Hoare triple {25836#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {25363#false} is VALID [2022-04-08 03:35:53,802 INFO L290 TraceCheckUtils]: 155: Hoare triple {25363#false} ~i~0 := 0; {25363#false} is VALID [2022-04-08 03:35:53,802 INFO L290 TraceCheckUtils]: 156: Hoare triple {25363#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25363#false} is VALID [2022-04-08 03:35:53,802 INFO L272 TraceCheckUtils]: 157: Hoare triple {25363#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {25363#false} is VALID [2022-04-08 03:35:53,803 INFO L290 TraceCheckUtils]: 158: Hoare triple {25363#false} ~cond := #in~cond; {25363#false} is VALID [2022-04-08 03:35:53,803 INFO L290 TraceCheckUtils]: 159: Hoare triple {25363#false} assume 0 == ~cond; {25363#false} is VALID [2022-04-08 03:35:53,803 INFO L290 TraceCheckUtils]: 160: Hoare triple {25363#false} assume !false; {25363#false} is VALID [2022-04-08 03:35:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2460 trivial. 0 not checked. [2022-04-08 03:35:53,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:54,260 INFO L290 TraceCheckUtils]: 160: Hoare triple {25363#false} assume !false; {25363#false} is VALID [2022-04-08 03:35:54,260 INFO L290 TraceCheckUtils]: 159: Hoare triple {25363#false} assume 0 == ~cond; {25363#false} is VALID [2022-04-08 03:35:54,261 INFO L290 TraceCheckUtils]: 158: Hoare triple {25363#false} ~cond := #in~cond; {25363#false} is VALID [2022-04-08 03:35:54,261 INFO L272 TraceCheckUtils]: 157: Hoare triple {25363#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {25363#false} is VALID [2022-04-08 03:35:54,261 INFO L290 TraceCheckUtils]: 156: Hoare triple {25363#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25363#false} is VALID [2022-04-08 03:35:54,261 INFO L290 TraceCheckUtils]: 155: Hoare triple {25363#false} ~i~0 := 0; {25363#false} is VALID [2022-04-08 03:35:54,261 INFO L290 TraceCheckUtils]: 154: Hoare triple {25876#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {25363#false} is VALID [2022-04-08 03:35:54,263 INFO L290 TraceCheckUtils]: 153: Hoare triple {25880#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {25876#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,263 INFO L290 TraceCheckUtils]: 152: Hoare triple {25880#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {25880#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:54,264 INFO L290 TraceCheckUtils]: 151: Hoare triple {25880#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {25880#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:54,264 INFO L290 TraceCheckUtils]: 150: Hoare triple {25890#(< 1 main_~edgecount~0)} ~i~0 := 0; {25880#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:35:54,264 INFO L290 TraceCheckUtils]: 149: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,265 INFO L290 TraceCheckUtils]: 148: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,265 INFO L290 TraceCheckUtils]: 147: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,265 INFO L290 TraceCheckUtils]: 146: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,265 INFO L290 TraceCheckUtils]: 145: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,266 INFO L290 TraceCheckUtils]: 144: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,266 INFO L290 TraceCheckUtils]: 143: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,266 INFO L290 TraceCheckUtils]: 142: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,266 INFO L290 TraceCheckUtils]: 141: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,267 INFO L290 TraceCheckUtils]: 140: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,267 INFO L290 TraceCheckUtils]: 139: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,267 INFO L290 TraceCheckUtils]: 138: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,267 INFO L290 TraceCheckUtils]: 137: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,268 INFO L290 TraceCheckUtils]: 136: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,268 INFO L290 TraceCheckUtils]: 135: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,268 INFO L290 TraceCheckUtils]: 134: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,268 INFO L290 TraceCheckUtils]: 133: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,268 INFO L290 TraceCheckUtils]: 132: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,269 INFO L290 TraceCheckUtils]: 131: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,269 INFO L290 TraceCheckUtils]: 130: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,269 INFO L290 TraceCheckUtils]: 129: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,269 INFO L290 TraceCheckUtils]: 128: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,270 INFO L290 TraceCheckUtils]: 127: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,270 INFO L290 TraceCheckUtils]: 126: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,270 INFO L290 TraceCheckUtils]: 125: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,270 INFO L290 TraceCheckUtils]: 124: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,271 INFO L290 TraceCheckUtils]: 123: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,271 INFO L290 TraceCheckUtils]: 122: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,271 INFO L290 TraceCheckUtils]: 121: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,271 INFO L290 TraceCheckUtils]: 120: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,272 INFO L290 TraceCheckUtils]: 119: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,272 INFO L290 TraceCheckUtils]: 118: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,272 INFO L290 TraceCheckUtils]: 117: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,272 INFO L290 TraceCheckUtils]: 116: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,273 INFO L290 TraceCheckUtils]: 115: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,273 INFO L290 TraceCheckUtils]: 114: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,273 INFO L290 TraceCheckUtils]: 113: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,273 INFO L290 TraceCheckUtils]: 112: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,274 INFO L290 TraceCheckUtils]: 111: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,274 INFO L290 TraceCheckUtils]: 110: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,274 INFO L290 TraceCheckUtils]: 109: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,274 INFO L290 TraceCheckUtils]: 108: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,275 INFO L290 TraceCheckUtils]: 107: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,275 INFO L290 TraceCheckUtils]: 106: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,275 INFO L290 TraceCheckUtils]: 105: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,275 INFO L290 TraceCheckUtils]: 104: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,276 INFO L290 TraceCheckUtils]: 103: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,276 INFO L290 TraceCheckUtils]: 102: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,276 INFO L290 TraceCheckUtils]: 101: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,276 INFO L290 TraceCheckUtils]: 100: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,277 INFO L290 TraceCheckUtils]: 99: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,277 INFO L290 TraceCheckUtils]: 98: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,277 INFO L290 TraceCheckUtils]: 97: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,277 INFO L290 TraceCheckUtils]: 96: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,278 INFO L290 TraceCheckUtils]: 95: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,278 INFO L290 TraceCheckUtils]: 94: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,278 INFO L290 TraceCheckUtils]: 93: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,278 INFO L290 TraceCheckUtils]: 92: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,279 INFO L290 TraceCheckUtils]: 91: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,279 INFO L290 TraceCheckUtils]: 90: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,279 INFO L290 TraceCheckUtils]: 89: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,279 INFO L290 TraceCheckUtils]: 88: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,280 INFO L290 TraceCheckUtils]: 87: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,280 INFO L290 TraceCheckUtils]: 86: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,280 INFO L290 TraceCheckUtils]: 85: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,280 INFO L290 TraceCheckUtils]: 84: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,281 INFO L290 TraceCheckUtils]: 83: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,281 INFO L290 TraceCheckUtils]: 82: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,281 INFO L290 TraceCheckUtils]: 81: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,281 INFO L290 TraceCheckUtils]: 80: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,282 INFO L290 TraceCheckUtils]: 79: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,282 INFO L290 TraceCheckUtils]: 78: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,282 INFO L290 TraceCheckUtils]: 77: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,282 INFO L290 TraceCheckUtils]: 76: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,283 INFO L290 TraceCheckUtils]: 75: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,283 INFO L290 TraceCheckUtils]: 74: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,283 INFO L290 TraceCheckUtils]: 73: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,283 INFO L290 TraceCheckUtils]: 72: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,284 INFO L290 TraceCheckUtils]: 71: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,284 INFO L290 TraceCheckUtils]: 70: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,284 INFO L290 TraceCheckUtils]: 69: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,284 INFO L290 TraceCheckUtils]: 68: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,285 INFO L290 TraceCheckUtils]: 67: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,285 INFO L290 TraceCheckUtils]: 66: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,285 INFO L290 TraceCheckUtils]: 65: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,303 INFO L290 TraceCheckUtils]: 64: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,304 INFO L290 TraceCheckUtils]: 63: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,304 INFO L290 TraceCheckUtils]: 62: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,304 INFO L290 TraceCheckUtils]: 61: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,304 INFO L290 TraceCheckUtils]: 60: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,305 INFO L290 TraceCheckUtils]: 59: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,306 INFO L290 TraceCheckUtils]: 55: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,306 INFO L290 TraceCheckUtils]: 54: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,306 INFO L290 TraceCheckUtils]: 53: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,306 INFO L290 TraceCheckUtils]: 52: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,307 INFO L290 TraceCheckUtils]: 51: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,307 INFO L290 TraceCheckUtils]: 50: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,307 INFO L290 TraceCheckUtils]: 49: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,307 INFO L290 TraceCheckUtils]: 48: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,308 INFO L290 TraceCheckUtils]: 47: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,308 INFO L290 TraceCheckUtils]: 46: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,308 INFO L290 TraceCheckUtils]: 45: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,308 INFO L290 TraceCheckUtils]: 44: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,308 INFO L290 TraceCheckUtils]: 43: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,309 INFO L290 TraceCheckUtils]: 42: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,309 INFO L290 TraceCheckUtils]: 39: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,310 INFO L290 TraceCheckUtils]: 37: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,310 INFO L290 TraceCheckUtils]: 36: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {25890#(< 1 main_~edgecount~0)} ~i~0 := 0; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {25890#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {25362#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:35:54,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {25362#true} call #t~ret22 := main(); {25362#true} is VALID [2022-04-08 03:35:54,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25362#true} {25362#true} #107#return; {25362#true} is VALID [2022-04-08 03:35:54,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {25362#true} assume true; {25362#true} is VALID [2022-04-08 03:35:54,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {25362#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {25362#true} is VALID [2022-04-08 03:35:54,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {25362#true} call ULTIMATE.init(); {25362#true} is VALID [2022-04-08 03:35:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2460 trivial. 0 not checked. [2022-04-08 03:35:54,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370212220] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:54,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:54,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-04-08 03:35:54,321 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:54,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [36600537] [2022-04-08 03:35:54,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [36600537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:54,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:54,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:35:54,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083778372] [2022-04-08 03:35:54,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:54,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2022-04-08 03:35:54,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:54,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:54,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:54,344 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:35:54,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:54,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:35:54,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-08 03:35:54,345 INFO L87 Difference]: Start difference. First operand 166 states and 212 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:55,602 INFO L93 Difference]: Finished difference Result 329 states and 424 transitions. [2022-04-08 03:35:55,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:35:55,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2022-04-08 03:35:55,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-08 03:35:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-08 03:35:55,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 111 transitions. [2022-04-08 03:35:55,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:55,692 INFO L225 Difference]: With dead ends: 329 [2022-04-08 03:35:55,692 INFO L226 Difference]: Without dead ends: 313 [2022-04-08 03:35:55,693 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-04-08 03:35:55,693 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 139 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:55,693 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 34 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-04-08 03:35:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 229. [2022-04-08 03:35:56,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:56,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 313 states. Second operand has 229 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:56,462 INFO L74 IsIncluded]: Start isIncluded. First operand 313 states. Second operand has 229 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:56,462 INFO L87 Difference]: Start difference. First operand 313 states. Second operand has 229 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:56,472 INFO L93 Difference]: Finished difference Result 313 states and 406 transitions. [2022-04-08 03:35:56,472 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 406 transitions. [2022-04-08 03:35:56,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:56,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:56,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 313 states. [2022-04-08 03:35:56,473 INFO L87 Difference]: Start difference. First operand has 229 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 313 states. [2022-04-08 03:35:56,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:56,477 INFO L93 Difference]: Finished difference Result 313 states and 406 transitions. [2022-04-08 03:35:56,477 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 406 transitions. [2022-04-08 03:35:56,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:56,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:56,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:56,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 296 transitions. [2022-04-08 03:35:56,481 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 296 transitions. Word has length 161 [2022-04-08 03:35:56,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:56,481 INFO L478 AbstractCegarLoop]: Abstraction has 229 states and 296 transitions. [2022-04-08 03:35:56,481 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:56,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 296 transitions. [2022-04-08 03:35:56,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 296 transitions. [2022-04-08 03:35:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-04-08 03:35:56,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:56,944 INFO L499 BasicCegarLoop]: trace histogram [60, 60, 60, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:56,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-08 03:35:57,160 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-08 03:35:57,160 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:57,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:57,161 INFO L85 PathProgramCache]: Analyzing trace with hash 54436442, now seen corresponding path program 49 times [2022-04-08 03:35:57,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:57,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1600392477] [2022-04-08 03:35:57,163 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:57,163 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:57,163 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:57,163 INFO L85 PathProgramCache]: Analyzing trace with hash 54436442, now seen corresponding path program 50 times [2022-04-08 03:35:57,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:57,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299194852] [2022-04-08 03:35:57,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:57,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:57,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:57,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {28103#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {28093#true} is VALID [2022-04-08 03:35:57,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {28093#true} assume true; {28093#true} is VALID [2022-04-08 03:35:57,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28093#true} {28093#true} #107#return; {28093#true} is VALID [2022-04-08 03:35:57,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {28093#true} call ULTIMATE.init(); {28103#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:57,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {28103#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {28093#true} is VALID [2022-04-08 03:35:57,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {28093#true} assume true; {28093#true} is VALID [2022-04-08 03:35:57,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28093#true} {28093#true} #107#return; {28093#true} is VALID [2022-04-08 03:35:57,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {28093#true} call #t~ret22 := main(); {28093#true} is VALID [2022-04-08 03:35:57,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {28093#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:57,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:57,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:57,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:57,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:57,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:57,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:57,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:57,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:57,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:57,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:57,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:57,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:57,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:57,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:57,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:57,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 < ~nodecount~0); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:35:57,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} ~i~0 := 0; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,390 INFO L290 TraceCheckUtils]: 34: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,390 INFO L290 TraceCheckUtils]: 35: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,391 INFO L290 TraceCheckUtils]: 36: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,393 INFO L290 TraceCheckUtils]: 41: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,394 INFO L290 TraceCheckUtils]: 42: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,394 INFO L290 TraceCheckUtils]: 43: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,394 INFO L290 TraceCheckUtils]: 44: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,395 INFO L290 TraceCheckUtils]: 45: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,395 INFO L290 TraceCheckUtils]: 46: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,396 INFO L290 TraceCheckUtils]: 47: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,396 INFO L290 TraceCheckUtils]: 48: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,397 INFO L290 TraceCheckUtils]: 49: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,397 INFO L290 TraceCheckUtils]: 50: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,398 INFO L290 TraceCheckUtils]: 51: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,399 INFO L290 TraceCheckUtils]: 53: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,399 INFO L290 TraceCheckUtils]: 54: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,400 INFO L290 TraceCheckUtils]: 55: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,400 INFO L290 TraceCheckUtils]: 56: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,401 INFO L290 TraceCheckUtils]: 57: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,401 INFO L290 TraceCheckUtils]: 58: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,401 INFO L290 TraceCheckUtils]: 59: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,402 INFO L290 TraceCheckUtils]: 60: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,403 INFO L290 TraceCheckUtils]: 61: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,403 INFO L290 TraceCheckUtils]: 62: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,403 INFO L290 TraceCheckUtils]: 63: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,404 INFO L290 TraceCheckUtils]: 64: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,404 INFO L290 TraceCheckUtils]: 65: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,405 INFO L290 TraceCheckUtils]: 66: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,405 INFO L290 TraceCheckUtils]: 67: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,406 INFO L290 TraceCheckUtils]: 68: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,406 INFO L290 TraceCheckUtils]: 69: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,407 INFO L290 TraceCheckUtils]: 70: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,407 INFO L290 TraceCheckUtils]: 71: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,408 INFO L290 TraceCheckUtils]: 72: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,408 INFO L290 TraceCheckUtils]: 73: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,409 INFO L290 TraceCheckUtils]: 74: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,409 INFO L290 TraceCheckUtils]: 75: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,410 INFO L290 TraceCheckUtils]: 76: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,410 INFO L290 TraceCheckUtils]: 77: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,411 INFO L290 TraceCheckUtils]: 78: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,411 INFO L290 TraceCheckUtils]: 79: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,411 INFO L290 TraceCheckUtils]: 80: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,412 INFO L290 TraceCheckUtils]: 81: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,413 INFO L290 TraceCheckUtils]: 82: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,413 INFO L290 TraceCheckUtils]: 83: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,413 INFO L290 TraceCheckUtils]: 84: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:35:57,414 INFO L290 TraceCheckUtils]: 85: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,414 INFO L290 TraceCheckUtils]: 86: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,415 INFO L290 TraceCheckUtils]: 87: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,415 INFO L290 TraceCheckUtils]: 88: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,415 INFO L290 TraceCheckUtils]: 89: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,416 INFO L290 TraceCheckUtils]: 90: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,416 INFO L290 TraceCheckUtils]: 91: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,417 INFO L290 TraceCheckUtils]: 92: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,417 INFO L290 TraceCheckUtils]: 93: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,418 INFO L290 TraceCheckUtils]: 94: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,418 INFO L290 TraceCheckUtils]: 95: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,419 INFO L290 TraceCheckUtils]: 96: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,419 INFO L290 TraceCheckUtils]: 97: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,420 INFO L290 TraceCheckUtils]: 98: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,420 INFO L290 TraceCheckUtils]: 99: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,421 INFO L290 TraceCheckUtils]: 100: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,421 INFO L290 TraceCheckUtils]: 101: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,422 INFO L290 TraceCheckUtils]: 102: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,422 INFO L290 TraceCheckUtils]: 103: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,422 INFO L290 TraceCheckUtils]: 104: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,423 INFO L290 TraceCheckUtils]: 105: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,423 INFO L290 TraceCheckUtils]: 106: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,424 INFO L290 TraceCheckUtils]: 107: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,424 INFO L290 TraceCheckUtils]: 108: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,425 INFO L290 TraceCheckUtils]: 109: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,425 INFO L290 TraceCheckUtils]: 110: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,426 INFO L290 TraceCheckUtils]: 111: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,426 INFO L290 TraceCheckUtils]: 112: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,427 INFO L290 TraceCheckUtils]: 113: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,427 INFO L290 TraceCheckUtils]: 114: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,428 INFO L290 TraceCheckUtils]: 115: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,428 INFO L290 TraceCheckUtils]: 116: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,429 INFO L290 TraceCheckUtils]: 117: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,429 INFO L290 TraceCheckUtils]: 118: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,429 INFO L290 TraceCheckUtils]: 119: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,430 INFO L290 TraceCheckUtils]: 120: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,430 INFO L290 TraceCheckUtils]: 121: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,431 INFO L290 TraceCheckUtils]: 122: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,431 INFO L290 TraceCheckUtils]: 123: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,432 INFO L290 TraceCheckUtils]: 124: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,432 INFO L290 TraceCheckUtils]: 125: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,433 INFO L290 TraceCheckUtils]: 126: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,433 INFO L290 TraceCheckUtils]: 127: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,434 INFO L290 TraceCheckUtils]: 128: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,434 INFO L290 TraceCheckUtils]: 129: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,435 INFO L290 TraceCheckUtils]: 130: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,435 INFO L290 TraceCheckUtils]: 131: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,436 INFO L290 TraceCheckUtils]: 132: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,436 INFO L290 TraceCheckUtils]: 133: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,436 INFO L290 TraceCheckUtils]: 134: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,437 INFO L290 TraceCheckUtils]: 135: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,437 INFO L290 TraceCheckUtils]: 136: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,438 INFO L290 TraceCheckUtils]: 137: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,438 INFO L290 TraceCheckUtils]: 138: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,439 INFO L290 TraceCheckUtils]: 139: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,439 INFO L290 TraceCheckUtils]: 140: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,440 INFO L290 TraceCheckUtils]: 141: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,440 INFO L290 TraceCheckUtils]: 142: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,441 INFO L290 TraceCheckUtils]: 143: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,441 INFO L290 TraceCheckUtils]: 144: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,442 INFO L290 TraceCheckUtils]: 145: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,442 INFO L290 TraceCheckUtils]: 146: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,442 INFO L290 TraceCheckUtils]: 147: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~j~0 < ~edgecount~0); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:35:57,443 INFO L290 TraceCheckUtils]: 148: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,443 INFO L290 TraceCheckUtils]: 149: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,444 INFO L290 TraceCheckUtils]: 150: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,444 INFO L290 TraceCheckUtils]: 151: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,445 INFO L290 TraceCheckUtils]: 152: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,445 INFO L290 TraceCheckUtils]: 153: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,446 INFO L290 TraceCheckUtils]: 154: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,446 INFO L290 TraceCheckUtils]: 155: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,447 INFO L290 TraceCheckUtils]: 156: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,447 INFO L290 TraceCheckUtils]: 157: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,448 INFO L290 TraceCheckUtils]: 158: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,448 INFO L290 TraceCheckUtils]: 159: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,449 INFO L290 TraceCheckUtils]: 160: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,449 INFO L290 TraceCheckUtils]: 161: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,450 INFO L290 TraceCheckUtils]: 162: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,450 INFO L290 TraceCheckUtils]: 163: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,450 INFO L290 TraceCheckUtils]: 164: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,451 INFO L290 TraceCheckUtils]: 165: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,451 INFO L290 TraceCheckUtils]: 166: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,452 INFO L290 TraceCheckUtils]: 167: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,452 INFO L290 TraceCheckUtils]: 168: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,453 INFO L290 TraceCheckUtils]: 169: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,453 INFO L290 TraceCheckUtils]: 170: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,454 INFO L290 TraceCheckUtils]: 171: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,454 INFO L290 TraceCheckUtils]: 172: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,455 INFO L290 TraceCheckUtils]: 173: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,455 INFO L290 TraceCheckUtils]: 174: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,456 INFO L290 TraceCheckUtils]: 175: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,456 INFO L290 TraceCheckUtils]: 176: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,457 INFO L290 TraceCheckUtils]: 177: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,457 INFO L290 TraceCheckUtils]: 178: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,457 INFO L290 TraceCheckUtils]: 179: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,458 INFO L290 TraceCheckUtils]: 180: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,459 INFO L290 TraceCheckUtils]: 181: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,459 INFO L290 TraceCheckUtils]: 182: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,459 INFO L290 TraceCheckUtils]: 183: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,460 INFO L290 TraceCheckUtils]: 184: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,460 INFO L290 TraceCheckUtils]: 185: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,461 INFO L290 TraceCheckUtils]: 186: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,461 INFO L290 TraceCheckUtils]: 187: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,462 INFO L290 TraceCheckUtils]: 188: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,462 INFO L290 TraceCheckUtils]: 189: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,463 INFO L290 TraceCheckUtils]: 190: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,463 INFO L290 TraceCheckUtils]: 191: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,464 INFO L290 TraceCheckUtils]: 192: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,464 INFO L290 TraceCheckUtils]: 193: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,465 INFO L290 TraceCheckUtils]: 194: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,465 INFO L290 TraceCheckUtils]: 195: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,466 INFO L290 TraceCheckUtils]: 196: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,466 INFO L290 TraceCheckUtils]: 197: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,466 INFO L290 TraceCheckUtils]: 198: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,467 INFO L290 TraceCheckUtils]: 199: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,467 INFO L290 TraceCheckUtils]: 200: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,468 INFO L290 TraceCheckUtils]: 201: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,468 INFO L290 TraceCheckUtils]: 202: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,469 INFO L290 TraceCheckUtils]: 203: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,469 INFO L290 TraceCheckUtils]: 204: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,470 INFO L290 TraceCheckUtils]: 205: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,470 INFO L290 TraceCheckUtils]: 206: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,471 INFO L290 TraceCheckUtils]: 207: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,471 INFO L290 TraceCheckUtils]: 208: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,472 INFO L290 TraceCheckUtils]: 209: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,472 INFO L290 TraceCheckUtils]: 210: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~j~0 < ~edgecount~0); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:35:57,472 INFO L290 TraceCheckUtils]: 211: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28102#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:35:57,473 INFO L290 TraceCheckUtils]: 212: Hoare triple {28102#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !(~i~0 < ~nodecount~0); {28094#false} is VALID [2022-04-08 03:35:57,473 INFO L290 TraceCheckUtils]: 213: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-08 03:35:57,473 INFO L290 TraceCheckUtils]: 214: Hoare triple {28094#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {28094#false} is VALID [2022-04-08 03:35:57,473 INFO L290 TraceCheckUtils]: 215: Hoare triple {28094#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {28094#false} is VALID [2022-04-08 03:35:57,473 INFO L290 TraceCheckUtils]: 216: Hoare triple {28094#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {28094#false} is VALID [2022-04-08 03:35:57,473 INFO L290 TraceCheckUtils]: 217: Hoare triple {28094#false} assume !(~i~0 < ~edgecount~0); {28094#false} is VALID [2022-04-08 03:35:57,473 INFO L290 TraceCheckUtils]: 218: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-08 03:35:57,473 INFO L290 TraceCheckUtils]: 219: Hoare triple {28094#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28094#false} is VALID [2022-04-08 03:35:57,474 INFO L272 TraceCheckUtils]: 220: Hoare triple {28094#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {28094#false} is VALID [2022-04-08 03:35:57,474 INFO L290 TraceCheckUtils]: 221: Hoare triple {28094#false} ~cond := #in~cond; {28094#false} is VALID [2022-04-08 03:35:57,474 INFO L290 TraceCheckUtils]: 222: Hoare triple {28094#false} assume 0 == ~cond; {28094#false} is VALID [2022-04-08 03:35:57,474 INFO L290 TraceCheckUtils]: 223: Hoare triple {28094#false} assume !false; {28094#false} is VALID [2022-04-08 03:35:57,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5538 backedges. 0 proven. 3732 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2022-04-08 03:35:57,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:57,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299194852] [2022-04-08 03:35:57,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299194852] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:57,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595077509] [2022-04-08 03:35:57,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:57,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:57,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:57,492 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:57,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-08 03:35:57,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:57,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:57,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 03:35:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:57,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:59,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {28093#true} call ULTIMATE.init(); {28093#true} is VALID [2022-04-08 03:35:59,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {28093#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {28093#true} is VALID [2022-04-08 03:35:59,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {28093#true} assume true; {28093#true} is VALID [2022-04-08 03:35:59,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28093#true} {28093#true} #107#return; {28093#true} is VALID [2022-04-08 03:35:59,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {28093#true} call #t~ret22 := main(); {28093#true} is VALID [2022-04-08 03:35:59,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {28093#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:59,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:59,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:59,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {28122#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:59,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:59,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:59,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {28122#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:59,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:59,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:59,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {28122#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:59,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:59,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:59,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {28122#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:59,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:59,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:59,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {28122#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:59,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-08 03:35:59,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {28122#(<= 5 main_~nodecount~0)} ~i~0 := 0; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,222 INFO L290 TraceCheckUtils]: 31: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,224 INFO L290 TraceCheckUtils]: 36: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,227 INFO L290 TraceCheckUtils]: 44: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,228 INFO L290 TraceCheckUtils]: 45: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,228 INFO L290 TraceCheckUtils]: 46: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,228 INFO L290 TraceCheckUtils]: 47: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,229 INFO L290 TraceCheckUtils]: 49: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,229 INFO L290 TraceCheckUtils]: 50: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,230 INFO L290 TraceCheckUtils]: 51: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,230 INFO L290 TraceCheckUtils]: 52: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,231 INFO L290 TraceCheckUtils]: 53: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,231 INFO L290 TraceCheckUtils]: 55: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,233 INFO L290 TraceCheckUtils]: 59: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,233 INFO L290 TraceCheckUtils]: 60: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,234 INFO L290 TraceCheckUtils]: 61: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,234 INFO L290 TraceCheckUtils]: 62: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,234 INFO L290 TraceCheckUtils]: 63: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,235 INFO L290 TraceCheckUtils]: 64: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,235 INFO L290 TraceCheckUtils]: 65: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,235 INFO L290 TraceCheckUtils]: 66: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,236 INFO L290 TraceCheckUtils]: 67: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,236 INFO L290 TraceCheckUtils]: 68: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,236 INFO L290 TraceCheckUtils]: 69: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,237 INFO L290 TraceCheckUtils]: 70: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,237 INFO L290 TraceCheckUtils]: 71: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,238 INFO L290 TraceCheckUtils]: 72: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,238 INFO L290 TraceCheckUtils]: 73: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,238 INFO L290 TraceCheckUtils]: 74: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,239 INFO L290 TraceCheckUtils]: 75: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,239 INFO L290 TraceCheckUtils]: 76: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,239 INFO L290 TraceCheckUtils]: 77: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,240 INFO L290 TraceCheckUtils]: 78: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,240 INFO L290 TraceCheckUtils]: 79: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,240 INFO L290 TraceCheckUtils]: 80: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,241 INFO L290 TraceCheckUtils]: 81: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,241 INFO L290 TraceCheckUtils]: 82: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,242 INFO L290 TraceCheckUtils]: 83: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,242 INFO L290 TraceCheckUtils]: 84: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,242 INFO L290 TraceCheckUtils]: 85: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,243 INFO L290 TraceCheckUtils]: 86: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,243 INFO L290 TraceCheckUtils]: 87: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,243 INFO L290 TraceCheckUtils]: 88: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,244 INFO L290 TraceCheckUtils]: 89: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,244 INFO L290 TraceCheckUtils]: 90: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,245 INFO L290 TraceCheckUtils]: 91: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,245 INFO L290 TraceCheckUtils]: 92: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,245 INFO L290 TraceCheckUtils]: 93: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,246 INFO L290 TraceCheckUtils]: 94: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,246 INFO L290 TraceCheckUtils]: 95: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,246 INFO L290 TraceCheckUtils]: 96: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,247 INFO L290 TraceCheckUtils]: 97: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,247 INFO L290 TraceCheckUtils]: 98: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,253 INFO L290 TraceCheckUtils]: 99: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,254 INFO L290 TraceCheckUtils]: 100: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,254 INFO L290 TraceCheckUtils]: 101: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,254 INFO L290 TraceCheckUtils]: 102: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,255 INFO L290 TraceCheckUtils]: 103: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,255 INFO L290 TraceCheckUtils]: 104: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,256 INFO L290 TraceCheckUtils]: 105: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,256 INFO L290 TraceCheckUtils]: 106: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,256 INFO L290 TraceCheckUtils]: 107: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,257 INFO L290 TraceCheckUtils]: 108: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,257 INFO L290 TraceCheckUtils]: 109: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,257 INFO L290 TraceCheckUtils]: 110: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,258 INFO L290 TraceCheckUtils]: 111: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,258 INFO L290 TraceCheckUtils]: 112: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,258 INFO L290 TraceCheckUtils]: 113: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,259 INFO L290 TraceCheckUtils]: 114: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,259 INFO L290 TraceCheckUtils]: 115: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,260 INFO L290 TraceCheckUtils]: 116: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,260 INFO L290 TraceCheckUtils]: 117: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,260 INFO L290 TraceCheckUtils]: 118: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,261 INFO L290 TraceCheckUtils]: 119: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,261 INFO L290 TraceCheckUtils]: 120: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,262 INFO L290 TraceCheckUtils]: 121: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,262 INFO L290 TraceCheckUtils]: 122: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,262 INFO L290 TraceCheckUtils]: 123: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,263 INFO L290 TraceCheckUtils]: 124: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,263 INFO L290 TraceCheckUtils]: 125: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,263 INFO L290 TraceCheckUtils]: 126: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,264 INFO L290 TraceCheckUtils]: 127: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,264 INFO L290 TraceCheckUtils]: 128: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,264 INFO L290 TraceCheckUtils]: 129: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,265 INFO L290 TraceCheckUtils]: 130: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,265 INFO L290 TraceCheckUtils]: 131: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,266 INFO L290 TraceCheckUtils]: 132: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,266 INFO L290 TraceCheckUtils]: 133: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,266 INFO L290 TraceCheckUtils]: 134: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,267 INFO L290 TraceCheckUtils]: 135: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,267 INFO L290 TraceCheckUtils]: 136: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,267 INFO L290 TraceCheckUtils]: 137: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,268 INFO L290 TraceCheckUtils]: 138: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,268 INFO L290 TraceCheckUtils]: 139: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,268 INFO L290 TraceCheckUtils]: 140: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,269 INFO L290 TraceCheckUtils]: 141: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,269 INFO L290 TraceCheckUtils]: 142: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,270 INFO L290 TraceCheckUtils]: 143: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,270 INFO L290 TraceCheckUtils]: 144: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,270 INFO L290 TraceCheckUtils]: 145: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,271 INFO L290 TraceCheckUtils]: 146: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,271 INFO L290 TraceCheckUtils]: 147: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,271 INFO L290 TraceCheckUtils]: 148: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,272 INFO L290 TraceCheckUtils]: 149: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,272 INFO L290 TraceCheckUtils]: 150: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,273 INFO L290 TraceCheckUtils]: 151: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,273 INFO L290 TraceCheckUtils]: 152: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,273 INFO L290 TraceCheckUtils]: 153: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,274 INFO L290 TraceCheckUtils]: 154: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,274 INFO L290 TraceCheckUtils]: 155: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,274 INFO L290 TraceCheckUtils]: 156: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,275 INFO L290 TraceCheckUtils]: 157: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,275 INFO L290 TraceCheckUtils]: 158: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,276 INFO L290 TraceCheckUtils]: 159: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,276 INFO L290 TraceCheckUtils]: 160: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,276 INFO L290 TraceCheckUtils]: 161: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,277 INFO L290 TraceCheckUtils]: 162: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,277 INFO L290 TraceCheckUtils]: 163: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,277 INFO L290 TraceCheckUtils]: 164: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,278 INFO L290 TraceCheckUtils]: 165: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,278 INFO L290 TraceCheckUtils]: 166: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,278 INFO L290 TraceCheckUtils]: 167: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,279 INFO L290 TraceCheckUtils]: 168: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,279 INFO L290 TraceCheckUtils]: 169: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,280 INFO L290 TraceCheckUtils]: 170: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,280 INFO L290 TraceCheckUtils]: 171: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,280 INFO L290 TraceCheckUtils]: 172: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,281 INFO L290 TraceCheckUtils]: 173: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,281 INFO L290 TraceCheckUtils]: 174: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,281 INFO L290 TraceCheckUtils]: 175: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,282 INFO L290 TraceCheckUtils]: 176: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,282 INFO L290 TraceCheckUtils]: 177: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,283 INFO L290 TraceCheckUtils]: 178: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,283 INFO L290 TraceCheckUtils]: 179: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,283 INFO L290 TraceCheckUtils]: 180: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,284 INFO L290 TraceCheckUtils]: 181: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,284 INFO L290 TraceCheckUtils]: 182: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,284 INFO L290 TraceCheckUtils]: 183: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,285 INFO L290 TraceCheckUtils]: 184: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,285 INFO L290 TraceCheckUtils]: 185: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,286 INFO L290 TraceCheckUtils]: 186: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,286 INFO L290 TraceCheckUtils]: 187: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,286 INFO L290 TraceCheckUtils]: 188: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,287 INFO L290 TraceCheckUtils]: 189: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,287 INFO L290 TraceCheckUtils]: 190: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,287 INFO L290 TraceCheckUtils]: 191: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,288 INFO L290 TraceCheckUtils]: 192: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,288 INFO L290 TraceCheckUtils]: 193: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,288 INFO L290 TraceCheckUtils]: 194: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,289 INFO L290 TraceCheckUtils]: 195: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,289 INFO L290 TraceCheckUtils]: 196: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,290 INFO L290 TraceCheckUtils]: 197: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,290 INFO L290 TraceCheckUtils]: 198: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,290 INFO L290 TraceCheckUtils]: 199: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,291 INFO L290 TraceCheckUtils]: 200: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,291 INFO L290 TraceCheckUtils]: 201: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,291 INFO L290 TraceCheckUtils]: 202: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,292 INFO L290 TraceCheckUtils]: 203: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,292 INFO L290 TraceCheckUtils]: 204: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,293 INFO L290 TraceCheckUtils]: 205: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,293 INFO L290 TraceCheckUtils]: 206: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,294 INFO L290 TraceCheckUtils]: 207: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,294 INFO L290 TraceCheckUtils]: 208: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,294 INFO L290 TraceCheckUtils]: 209: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,295 INFO L290 TraceCheckUtils]: 210: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-08 03:35:59,295 INFO L290 TraceCheckUtils]: 211: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28744#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 03:35:59,295 INFO L290 TraceCheckUtils]: 212: Hoare triple {28744#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} assume !(~i~0 < ~nodecount~0); {28094#false} is VALID [2022-04-08 03:35:59,295 INFO L290 TraceCheckUtils]: 213: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-08 03:35:59,295 INFO L290 TraceCheckUtils]: 214: Hoare triple {28094#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {28094#false} is VALID [2022-04-08 03:35:59,296 INFO L290 TraceCheckUtils]: 215: Hoare triple {28094#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {28094#false} is VALID [2022-04-08 03:35:59,296 INFO L290 TraceCheckUtils]: 216: Hoare triple {28094#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {28094#false} is VALID [2022-04-08 03:35:59,296 INFO L290 TraceCheckUtils]: 217: Hoare triple {28094#false} assume !(~i~0 < ~edgecount~0); {28094#false} is VALID [2022-04-08 03:35:59,296 INFO L290 TraceCheckUtils]: 218: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-08 03:35:59,296 INFO L290 TraceCheckUtils]: 219: Hoare triple {28094#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28094#false} is VALID [2022-04-08 03:35:59,296 INFO L272 TraceCheckUtils]: 220: Hoare triple {28094#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {28094#false} is VALID [2022-04-08 03:35:59,296 INFO L290 TraceCheckUtils]: 221: Hoare triple {28094#false} ~cond := #in~cond; {28094#false} is VALID [2022-04-08 03:35:59,296 INFO L290 TraceCheckUtils]: 222: Hoare triple {28094#false} assume 0 == ~cond; {28094#false} is VALID [2022-04-08 03:35:59,296 INFO L290 TraceCheckUtils]: 223: Hoare triple {28094#false} assume !false; {28094#false} is VALID [2022-04-08 03:35:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5538 backedges. 0 proven. 3732 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2022-04-08 03:35:59,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:36:00,045 INFO L290 TraceCheckUtils]: 223: Hoare triple {28094#false} assume !false; {28094#false} is VALID [2022-04-08 03:36:00,045 INFO L290 TraceCheckUtils]: 222: Hoare triple {28094#false} assume 0 == ~cond; {28094#false} is VALID [2022-04-08 03:36:00,045 INFO L290 TraceCheckUtils]: 221: Hoare triple {28094#false} ~cond := #in~cond; {28094#false} is VALID [2022-04-08 03:36:00,045 INFO L272 TraceCheckUtils]: 220: Hoare triple {28094#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {28094#false} is VALID [2022-04-08 03:36:00,045 INFO L290 TraceCheckUtils]: 219: Hoare triple {28094#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28094#false} is VALID [2022-04-08 03:36:00,045 INFO L290 TraceCheckUtils]: 218: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-08 03:36:00,045 INFO L290 TraceCheckUtils]: 217: Hoare triple {28094#false} assume !(~i~0 < ~edgecount~0); {28094#false} is VALID [2022-04-08 03:36:00,045 INFO L290 TraceCheckUtils]: 216: Hoare triple {28094#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {28094#false} is VALID [2022-04-08 03:36:00,046 INFO L290 TraceCheckUtils]: 215: Hoare triple {28094#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {28094#false} is VALID [2022-04-08 03:36:00,046 INFO L290 TraceCheckUtils]: 214: Hoare triple {28094#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {28094#false} is VALID [2022-04-08 03:36:00,046 INFO L290 TraceCheckUtils]: 213: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-08 03:36:00,046 INFO L290 TraceCheckUtils]: 212: Hoare triple {28814#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {28094#false} is VALID [2022-04-08 03:36:00,047 INFO L290 TraceCheckUtils]: 211: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28814#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-08 03:36:00,047 INFO L290 TraceCheckUtils]: 210: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,047 INFO L290 TraceCheckUtils]: 209: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,047 INFO L290 TraceCheckUtils]: 208: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,048 INFO L290 TraceCheckUtils]: 207: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,048 INFO L290 TraceCheckUtils]: 206: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,048 INFO L290 TraceCheckUtils]: 205: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,048 INFO L290 TraceCheckUtils]: 204: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,049 INFO L290 TraceCheckUtils]: 203: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,049 INFO L290 TraceCheckUtils]: 202: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,049 INFO L290 TraceCheckUtils]: 201: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,050 INFO L290 TraceCheckUtils]: 200: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,050 INFO L290 TraceCheckUtils]: 199: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,050 INFO L290 TraceCheckUtils]: 198: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,050 INFO L290 TraceCheckUtils]: 197: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,051 INFO L290 TraceCheckUtils]: 196: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,051 INFO L290 TraceCheckUtils]: 195: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,051 INFO L290 TraceCheckUtils]: 194: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,051 INFO L290 TraceCheckUtils]: 193: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,052 INFO L290 TraceCheckUtils]: 192: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,052 INFO L290 TraceCheckUtils]: 191: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,052 INFO L290 TraceCheckUtils]: 190: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,053 INFO L290 TraceCheckUtils]: 189: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,053 INFO L290 TraceCheckUtils]: 188: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,053 INFO L290 TraceCheckUtils]: 187: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,053 INFO L290 TraceCheckUtils]: 186: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,054 INFO L290 TraceCheckUtils]: 185: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,054 INFO L290 TraceCheckUtils]: 184: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,054 INFO L290 TraceCheckUtils]: 183: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,055 INFO L290 TraceCheckUtils]: 182: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,055 INFO L290 TraceCheckUtils]: 181: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,055 INFO L290 TraceCheckUtils]: 180: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,056 INFO L290 TraceCheckUtils]: 179: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,056 INFO L290 TraceCheckUtils]: 178: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,056 INFO L290 TraceCheckUtils]: 177: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,057 INFO L290 TraceCheckUtils]: 176: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,057 INFO L290 TraceCheckUtils]: 175: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,057 INFO L290 TraceCheckUtils]: 174: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,057 INFO L290 TraceCheckUtils]: 173: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,058 INFO L290 TraceCheckUtils]: 172: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,058 INFO L290 TraceCheckUtils]: 171: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,058 INFO L290 TraceCheckUtils]: 170: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,059 INFO L290 TraceCheckUtils]: 169: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,059 INFO L290 TraceCheckUtils]: 168: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,059 INFO L290 TraceCheckUtils]: 167: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,059 INFO L290 TraceCheckUtils]: 166: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,060 INFO L290 TraceCheckUtils]: 165: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,060 INFO L290 TraceCheckUtils]: 164: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,060 INFO L290 TraceCheckUtils]: 163: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,061 INFO L290 TraceCheckUtils]: 162: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,061 INFO L290 TraceCheckUtils]: 161: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,061 INFO L290 TraceCheckUtils]: 160: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,061 INFO L290 TraceCheckUtils]: 159: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,062 INFO L290 TraceCheckUtils]: 158: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,062 INFO L290 TraceCheckUtils]: 157: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,062 INFO L290 TraceCheckUtils]: 156: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,062 INFO L290 TraceCheckUtils]: 155: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,063 INFO L290 TraceCheckUtils]: 154: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,063 INFO L290 TraceCheckUtils]: 153: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,063 INFO L290 TraceCheckUtils]: 152: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,063 INFO L290 TraceCheckUtils]: 151: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,064 INFO L290 TraceCheckUtils]: 150: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,064 INFO L290 TraceCheckUtils]: 149: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,065 INFO L290 TraceCheckUtils]: 148: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,065 INFO L290 TraceCheckUtils]: 147: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,065 INFO L290 TraceCheckUtils]: 146: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,065 INFO L290 TraceCheckUtils]: 145: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,066 INFO L290 TraceCheckUtils]: 144: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,066 INFO L290 TraceCheckUtils]: 143: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,066 INFO L290 TraceCheckUtils]: 142: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,066 INFO L290 TraceCheckUtils]: 141: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,067 INFO L290 TraceCheckUtils]: 140: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,067 INFO L290 TraceCheckUtils]: 139: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,067 INFO L290 TraceCheckUtils]: 138: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,067 INFO L290 TraceCheckUtils]: 137: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,068 INFO L290 TraceCheckUtils]: 136: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,068 INFO L290 TraceCheckUtils]: 135: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,068 INFO L290 TraceCheckUtils]: 134: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,068 INFO L290 TraceCheckUtils]: 133: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,069 INFO L290 TraceCheckUtils]: 132: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,069 INFO L290 TraceCheckUtils]: 131: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,069 INFO L290 TraceCheckUtils]: 130: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,069 INFO L290 TraceCheckUtils]: 129: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,070 INFO L290 TraceCheckUtils]: 128: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,070 INFO L290 TraceCheckUtils]: 127: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,070 INFO L290 TraceCheckUtils]: 126: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,070 INFO L290 TraceCheckUtils]: 125: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,071 INFO L290 TraceCheckUtils]: 124: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,071 INFO L290 TraceCheckUtils]: 123: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,071 INFO L290 TraceCheckUtils]: 122: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,072 INFO L290 TraceCheckUtils]: 121: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,072 INFO L290 TraceCheckUtils]: 120: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,072 INFO L290 TraceCheckUtils]: 119: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,072 INFO L290 TraceCheckUtils]: 118: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,073 INFO L290 TraceCheckUtils]: 117: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,073 INFO L290 TraceCheckUtils]: 116: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,073 INFO L290 TraceCheckUtils]: 115: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,073 INFO L290 TraceCheckUtils]: 114: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,074 INFO L290 TraceCheckUtils]: 113: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,074 INFO L290 TraceCheckUtils]: 112: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,074 INFO L290 TraceCheckUtils]: 111: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,075 INFO L290 TraceCheckUtils]: 110: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,075 INFO L290 TraceCheckUtils]: 109: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,075 INFO L290 TraceCheckUtils]: 108: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,075 INFO L290 TraceCheckUtils]: 107: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,076 INFO L290 TraceCheckUtils]: 106: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,076 INFO L290 TraceCheckUtils]: 105: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,076 INFO L290 TraceCheckUtils]: 104: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,076 INFO L290 TraceCheckUtils]: 103: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,077 INFO L290 TraceCheckUtils]: 102: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,077 INFO L290 TraceCheckUtils]: 101: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,077 INFO L290 TraceCheckUtils]: 100: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,078 INFO L290 TraceCheckUtils]: 99: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,078 INFO L290 TraceCheckUtils]: 98: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,078 INFO L290 TraceCheckUtils]: 97: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,078 INFO L290 TraceCheckUtils]: 96: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,079 INFO L290 TraceCheckUtils]: 95: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,079 INFO L290 TraceCheckUtils]: 94: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,079 INFO L290 TraceCheckUtils]: 93: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,079 INFO L290 TraceCheckUtils]: 92: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,080 INFO L290 TraceCheckUtils]: 91: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,080 INFO L290 TraceCheckUtils]: 90: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,080 INFO L290 TraceCheckUtils]: 89: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,080 INFO L290 TraceCheckUtils]: 88: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,081 INFO L290 TraceCheckUtils]: 87: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,081 INFO L290 TraceCheckUtils]: 86: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,082 INFO L290 TraceCheckUtils]: 85: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,082 INFO L290 TraceCheckUtils]: 84: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,082 INFO L290 TraceCheckUtils]: 83: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,082 INFO L290 TraceCheckUtils]: 82: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,083 INFO L290 TraceCheckUtils]: 81: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,083 INFO L290 TraceCheckUtils]: 80: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,083 INFO L290 TraceCheckUtils]: 79: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,083 INFO L290 TraceCheckUtils]: 78: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,084 INFO L290 TraceCheckUtils]: 77: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,084 INFO L290 TraceCheckUtils]: 76: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,084 INFO L290 TraceCheckUtils]: 75: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,084 INFO L290 TraceCheckUtils]: 74: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,085 INFO L290 TraceCheckUtils]: 73: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,085 INFO L290 TraceCheckUtils]: 72: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,085 INFO L290 TraceCheckUtils]: 71: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,086 INFO L290 TraceCheckUtils]: 70: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,086 INFO L290 TraceCheckUtils]: 69: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,086 INFO L290 TraceCheckUtils]: 68: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,086 INFO L290 TraceCheckUtils]: 67: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,087 INFO L290 TraceCheckUtils]: 66: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,087 INFO L290 TraceCheckUtils]: 65: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,087 INFO L290 TraceCheckUtils]: 64: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,087 INFO L290 TraceCheckUtils]: 63: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,088 INFO L290 TraceCheckUtils]: 62: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,088 INFO L290 TraceCheckUtils]: 61: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,088 INFO L290 TraceCheckUtils]: 60: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,088 INFO L290 TraceCheckUtils]: 59: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,089 INFO L290 TraceCheckUtils]: 58: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,089 INFO L290 TraceCheckUtils]: 57: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,089 INFO L290 TraceCheckUtils]: 56: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,090 INFO L290 TraceCheckUtils]: 55: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,090 INFO L290 TraceCheckUtils]: 54: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,090 INFO L290 TraceCheckUtils]: 53: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,090 INFO L290 TraceCheckUtils]: 52: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,091 INFO L290 TraceCheckUtils]: 51: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,091 INFO L290 TraceCheckUtils]: 50: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,091 INFO L290 TraceCheckUtils]: 49: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,091 INFO L290 TraceCheckUtils]: 48: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,092 INFO L290 TraceCheckUtils]: 47: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,092 INFO L290 TraceCheckUtils]: 46: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,092 INFO L290 TraceCheckUtils]: 44: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,093 INFO L290 TraceCheckUtils]: 43: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,093 INFO L290 TraceCheckUtils]: 42: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,093 INFO L290 TraceCheckUtils]: 41: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,093 INFO L290 TraceCheckUtils]: 40: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,094 INFO L290 TraceCheckUtils]: 39: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,094 INFO L290 TraceCheckUtils]: 38: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,094 INFO L290 TraceCheckUtils]: 37: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,095 INFO L290 TraceCheckUtils]: 35: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,095 INFO L290 TraceCheckUtils]: 34: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,095 INFO L290 TraceCheckUtils]: 33: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,096 INFO L290 TraceCheckUtils]: 32: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {29388#(< 3 main_~nodecount~0)} ~i~0 := 0; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-08 03:36:00,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 03:36:00,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {29388#(< 3 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 03:36:00,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 03:36:00,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 03:36:00,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {29388#(< 3 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 03:36:00,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 03:36:00,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 03:36:00,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {29388#(< 3 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 03:36:00,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 03:36:00,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 03:36:00,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {29388#(< 3 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 03:36:00,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 03:36:00,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 03:36:00,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {29388#(< 3 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 03:36:00,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {29388#(< 3 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 03:36:00,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 03:36:00,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {28093#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-08 03:36:00,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {28093#true} call #t~ret22 := main(); {28093#true} is VALID [2022-04-08 03:36:00,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28093#true} {28093#true} #107#return; {28093#true} is VALID [2022-04-08 03:36:00,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {28093#true} assume true; {28093#true} is VALID [2022-04-08 03:36:00,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {28093#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {28093#true} is VALID [2022-04-08 03:36:00,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {28093#true} call ULTIMATE.init(); {28093#true} is VALID [2022-04-08 03:36:00,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5538 backedges. 0 proven. 3732 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2022-04-08 03:36:00,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595077509] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:36:00,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:36:00,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-04-08 03:36:00,107 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:36:00,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1600392477] [2022-04-08 03:36:00,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1600392477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:36:00,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:36:00,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:36:00,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161831254] [2022-04-08 03:36:00,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:36:00,108 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 224 [2022-04-08 03:36:00,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:36:00,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:00,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:00,137 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:36:00,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:00,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:36:00,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2022-04-08 03:36:00,138 INFO L87 Difference]: Start difference. First operand 229 states and 296 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:01,829 INFO L93 Difference]: Finished difference Result 400 states and 518 transitions. [2022-04-08 03:36:01,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:36:01,829 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 224 [2022-04-08 03:36:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:36:01,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-04-08 03:36:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-04-08 03:36:01,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 131 transitions. [2022-04-08 03:36:01,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:01,959 INFO L225 Difference]: With dead ends: 400 [2022-04-08 03:36:01,959 INFO L226 Difference]: Without dead ends: 384 [2022-04-08 03:36:01,960 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2022-04-08 03:36:01,960 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 200 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:36:01,960 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 34 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:36:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-04-08 03:36:03,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 292. [2022-04-08 03:36:03,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:36:03,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 384 states. Second operand has 292 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 286 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:03,036 INFO L74 IsIncluded]: Start isIncluded. First operand 384 states. Second operand has 292 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 286 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:03,037 INFO L87 Difference]: Start difference. First operand 384 states. Second operand has 292 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 286 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:03,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:03,053 INFO L93 Difference]: Finished difference Result 384 states and 500 transitions. [2022-04-08 03:36:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 500 transitions. [2022-04-08 03:36:03,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:03,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:03,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 292 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 286 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 384 states. [2022-04-08 03:36:03,055 INFO L87 Difference]: Start difference. First operand has 292 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 286 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 384 states. [2022-04-08 03:36:03,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:03,060 INFO L93 Difference]: Finished difference Result 384 states and 500 transitions. [2022-04-08 03:36:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 500 transitions. [2022-04-08 03:36:03,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:03,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:03,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:36:03,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:36:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 286 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 380 transitions. [2022-04-08 03:36:03,065 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 380 transitions. Word has length 224 [2022-04-08 03:36:03,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:36:03,066 INFO L478 AbstractCegarLoop]: Abstraction has 292 states and 380 transitions. [2022-04-08 03:36:03,066 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:03,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 292 states and 380 transitions. [2022-04-08 03:36:03,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:03,688 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 380 transitions. [2022-04-08 03:36:03,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-04-08 03:36:03,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:36:03,690 INFO L499 BasicCegarLoop]: trace histogram [80, 80, 80, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:36:03,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-08 03:36:03,890 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:36:03,890 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:36:03,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:36:03,890 INFO L85 PathProgramCache]: Analyzing trace with hash -381796264, now seen corresponding path program 51 times [2022-04-08 03:36:03,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:03,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1789051240] [2022-04-08 03:36:03,893 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:36:03,893 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:36:03,893 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:36:03,893 INFO L85 PathProgramCache]: Analyzing trace with hash -381796264, now seen corresponding path program 52 times [2022-04-08 03:36:03,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:36:03,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676552189] [2022-04-08 03:36:03,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:36:03,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:36:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:04,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:36:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:04,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {31630#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {31619#true} is VALID [2022-04-08 03:36:04,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-08 03:36:04,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31619#true} {31619#true} #107#return; {31619#true} is VALID [2022-04-08 03:36:04,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {31619#true} call ULTIMATE.init(); {31630#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:36:04,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {31630#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {31619#true} is VALID [2022-04-08 03:36:04,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-08 03:36:04,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31619#true} {31619#true} #107#return; {31619#true} is VALID [2022-04-08 03:36:04,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {31619#true} call #t~ret22 := main(); {31619#true} is VALID [2022-04-08 03:36:04,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {31619#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:36:04,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:36:04,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:36:04,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:36:04,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:36:04,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:36:04,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:36:04,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:36:04,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:36:04,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:36:04,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:36:04,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:36:04,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:36:04,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:36:04,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:36:04,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:36:04,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 < ~nodecount~0); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-08 03:36:04,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} ~i~0 := 0; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,202 INFO L290 TraceCheckUtils]: 26: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,204 INFO L290 TraceCheckUtils]: 31: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,206 INFO L290 TraceCheckUtils]: 35: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,206 INFO L290 TraceCheckUtils]: 36: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,207 INFO L290 TraceCheckUtils]: 39: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,208 INFO L290 TraceCheckUtils]: 41: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,208 INFO L290 TraceCheckUtils]: 42: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,209 INFO L290 TraceCheckUtils]: 45: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,210 INFO L290 TraceCheckUtils]: 46: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,210 INFO L290 TraceCheckUtils]: 47: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,210 INFO L290 TraceCheckUtils]: 48: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,211 INFO L290 TraceCheckUtils]: 50: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,211 INFO L290 TraceCheckUtils]: 51: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,212 INFO L290 TraceCheckUtils]: 52: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,212 INFO L290 TraceCheckUtils]: 53: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,213 INFO L290 TraceCheckUtils]: 54: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,213 INFO L290 TraceCheckUtils]: 55: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,213 INFO L290 TraceCheckUtils]: 56: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,214 INFO L290 TraceCheckUtils]: 57: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,214 INFO L290 TraceCheckUtils]: 58: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,214 INFO L290 TraceCheckUtils]: 59: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,215 INFO L290 TraceCheckUtils]: 60: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,215 INFO L290 TraceCheckUtils]: 61: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,215 INFO L290 TraceCheckUtils]: 62: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,216 INFO L290 TraceCheckUtils]: 63: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,216 INFO L290 TraceCheckUtils]: 64: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,216 INFO L290 TraceCheckUtils]: 65: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,217 INFO L290 TraceCheckUtils]: 66: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,217 INFO L290 TraceCheckUtils]: 67: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,217 INFO L290 TraceCheckUtils]: 68: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,218 INFO L290 TraceCheckUtils]: 69: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,218 INFO L290 TraceCheckUtils]: 70: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,219 INFO L290 TraceCheckUtils]: 71: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,219 INFO L290 TraceCheckUtils]: 72: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,219 INFO L290 TraceCheckUtils]: 73: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,220 INFO L290 TraceCheckUtils]: 74: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,220 INFO L290 TraceCheckUtils]: 75: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,220 INFO L290 TraceCheckUtils]: 76: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,221 INFO L290 TraceCheckUtils]: 77: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,221 INFO L290 TraceCheckUtils]: 78: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,222 INFO L290 TraceCheckUtils]: 79: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,222 INFO L290 TraceCheckUtils]: 80: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,222 INFO L290 TraceCheckUtils]: 81: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,223 INFO L290 TraceCheckUtils]: 82: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,223 INFO L290 TraceCheckUtils]: 83: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,223 INFO L290 TraceCheckUtils]: 84: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:04,223 INFO L290 TraceCheckUtils]: 85: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,224 INFO L290 TraceCheckUtils]: 86: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,224 INFO L290 TraceCheckUtils]: 87: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,225 INFO L290 TraceCheckUtils]: 88: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,225 INFO L290 TraceCheckUtils]: 89: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,225 INFO L290 TraceCheckUtils]: 90: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,226 INFO L290 TraceCheckUtils]: 91: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,226 INFO L290 TraceCheckUtils]: 92: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,226 INFO L290 TraceCheckUtils]: 93: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,227 INFO L290 TraceCheckUtils]: 94: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,227 INFO L290 TraceCheckUtils]: 95: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,227 INFO L290 TraceCheckUtils]: 96: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,228 INFO L290 TraceCheckUtils]: 97: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,228 INFO L290 TraceCheckUtils]: 98: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,228 INFO L290 TraceCheckUtils]: 99: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,229 INFO L290 TraceCheckUtils]: 100: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,229 INFO L290 TraceCheckUtils]: 101: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,229 INFO L290 TraceCheckUtils]: 102: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,230 INFO L290 TraceCheckUtils]: 103: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,230 INFO L290 TraceCheckUtils]: 104: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,230 INFO L290 TraceCheckUtils]: 105: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,231 INFO L290 TraceCheckUtils]: 106: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,231 INFO L290 TraceCheckUtils]: 107: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,232 INFO L290 TraceCheckUtils]: 108: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,232 INFO L290 TraceCheckUtils]: 109: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,232 INFO L290 TraceCheckUtils]: 110: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,233 INFO L290 TraceCheckUtils]: 111: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,233 INFO L290 TraceCheckUtils]: 112: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,233 INFO L290 TraceCheckUtils]: 113: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,234 INFO L290 TraceCheckUtils]: 114: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,234 INFO L290 TraceCheckUtils]: 115: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,234 INFO L290 TraceCheckUtils]: 116: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,235 INFO L290 TraceCheckUtils]: 117: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,235 INFO L290 TraceCheckUtils]: 118: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,235 INFO L290 TraceCheckUtils]: 119: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,236 INFO L290 TraceCheckUtils]: 120: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,236 INFO L290 TraceCheckUtils]: 121: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,236 INFO L290 TraceCheckUtils]: 122: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,237 INFO L290 TraceCheckUtils]: 123: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,237 INFO L290 TraceCheckUtils]: 124: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,237 INFO L290 TraceCheckUtils]: 125: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,238 INFO L290 TraceCheckUtils]: 126: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,238 INFO L290 TraceCheckUtils]: 127: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,239 INFO L290 TraceCheckUtils]: 128: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,239 INFO L290 TraceCheckUtils]: 129: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,239 INFO L290 TraceCheckUtils]: 130: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,240 INFO L290 TraceCheckUtils]: 131: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,240 INFO L290 TraceCheckUtils]: 132: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,240 INFO L290 TraceCheckUtils]: 133: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,241 INFO L290 TraceCheckUtils]: 134: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,241 INFO L290 TraceCheckUtils]: 135: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,241 INFO L290 TraceCheckUtils]: 136: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,242 INFO L290 TraceCheckUtils]: 137: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,242 INFO L290 TraceCheckUtils]: 138: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,243 INFO L290 TraceCheckUtils]: 139: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,243 INFO L290 TraceCheckUtils]: 140: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,243 INFO L290 TraceCheckUtils]: 141: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,244 INFO L290 TraceCheckUtils]: 142: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,244 INFO L290 TraceCheckUtils]: 143: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,244 INFO L290 TraceCheckUtils]: 144: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,245 INFO L290 TraceCheckUtils]: 145: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,245 INFO L290 TraceCheckUtils]: 146: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,245 INFO L290 TraceCheckUtils]: 147: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~j~0 < ~edgecount~0); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,246 INFO L290 TraceCheckUtils]: 148: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,246 INFO L290 TraceCheckUtils]: 149: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,246 INFO L290 TraceCheckUtils]: 150: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,247 INFO L290 TraceCheckUtils]: 151: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,247 INFO L290 TraceCheckUtils]: 152: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,247 INFO L290 TraceCheckUtils]: 153: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,248 INFO L290 TraceCheckUtils]: 154: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,248 INFO L290 TraceCheckUtils]: 155: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,248 INFO L290 TraceCheckUtils]: 156: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,249 INFO L290 TraceCheckUtils]: 157: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,249 INFO L290 TraceCheckUtils]: 158: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,250 INFO L290 TraceCheckUtils]: 159: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,250 INFO L290 TraceCheckUtils]: 160: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,250 INFO L290 TraceCheckUtils]: 161: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,251 INFO L290 TraceCheckUtils]: 162: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,251 INFO L290 TraceCheckUtils]: 163: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,251 INFO L290 TraceCheckUtils]: 164: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,252 INFO L290 TraceCheckUtils]: 165: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,252 INFO L290 TraceCheckUtils]: 166: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,252 INFO L290 TraceCheckUtils]: 167: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,253 INFO L290 TraceCheckUtils]: 168: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,253 INFO L290 TraceCheckUtils]: 169: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,253 INFO L290 TraceCheckUtils]: 170: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,254 INFO L290 TraceCheckUtils]: 171: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,254 INFO L290 TraceCheckUtils]: 172: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,254 INFO L290 TraceCheckUtils]: 173: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,255 INFO L290 TraceCheckUtils]: 174: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,255 INFO L290 TraceCheckUtils]: 175: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,255 INFO L290 TraceCheckUtils]: 176: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,256 INFO L290 TraceCheckUtils]: 177: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,256 INFO L290 TraceCheckUtils]: 178: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,257 INFO L290 TraceCheckUtils]: 179: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,257 INFO L290 TraceCheckUtils]: 180: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,257 INFO L290 TraceCheckUtils]: 181: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,258 INFO L290 TraceCheckUtils]: 182: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,258 INFO L290 TraceCheckUtils]: 183: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,258 INFO L290 TraceCheckUtils]: 184: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,259 INFO L290 TraceCheckUtils]: 185: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,259 INFO L290 TraceCheckUtils]: 186: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,259 INFO L290 TraceCheckUtils]: 187: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,260 INFO L290 TraceCheckUtils]: 188: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,260 INFO L290 TraceCheckUtils]: 189: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,260 INFO L290 TraceCheckUtils]: 190: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,261 INFO L290 TraceCheckUtils]: 191: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,261 INFO L290 TraceCheckUtils]: 192: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,261 INFO L290 TraceCheckUtils]: 193: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,262 INFO L290 TraceCheckUtils]: 194: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,262 INFO L290 TraceCheckUtils]: 195: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,263 INFO L290 TraceCheckUtils]: 196: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,263 INFO L290 TraceCheckUtils]: 197: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,263 INFO L290 TraceCheckUtils]: 198: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,264 INFO L290 TraceCheckUtils]: 199: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,264 INFO L290 TraceCheckUtils]: 200: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,264 INFO L290 TraceCheckUtils]: 201: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,265 INFO L290 TraceCheckUtils]: 202: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,265 INFO L290 TraceCheckUtils]: 203: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,265 INFO L290 TraceCheckUtils]: 204: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,266 INFO L290 TraceCheckUtils]: 205: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,266 INFO L290 TraceCheckUtils]: 206: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,266 INFO L290 TraceCheckUtils]: 207: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,267 INFO L290 TraceCheckUtils]: 208: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,267 INFO L290 TraceCheckUtils]: 209: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,267 INFO L290 TraceCheckUtils]: 210: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~j~0 < ~edgecount~0); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:04,268 INFO L290 TraceCheckUtils]: 211: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,268 INFO L290 TraceCheckUtils]: 212: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,268 INFO L290 TraceCheckUtils]: 213: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,269 INFO L290 TraceCheckUtils]: 214: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,269 INFO L290 TraceCheckUtils]: 215: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,269 INFO L290 TraceCheckUtils]: 216: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,270 INFO L290 TraceCheckUtils]: 217: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,270 INFO L290 TraceCheckUtils]: 218: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,271 INFO L290 TraceCheckUtils]: 219: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,271 INFO L290 TraceCheckUtils]: 220: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,271 INFO L290 TraceCheckUtils]: 221: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,272 INFO L290 TraceCheckUtils]: 222: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,272 INFO L290 TraceCheckUtils]: 223: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,272 INFO L290 TraceCheckUtils]: 224: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,273 INFO L290 TraceCheckUtils]: 225: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,273 INFO L290 TraceCheckUtils]: 226: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,273 INFO L290 TraceCheckUtils]: 227: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,274 INFO L290 TraceCheckUtils]: 228: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,274 INFO L290 TraceCheckUtils]: 229: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,274 INFO L290 TraceCheckUtils]: 230: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,275 INFO L290 TraceCheckUtils]: 231: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,275 INFO L290 TraceCheckUtils]: 232: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,275 INFO L290 TraceCheckUtils]: 233: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,276 INFO L290 TraceCheckUtils]: 234: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,276 INFO L290 TraceCheckUtils]: 235: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,276 INFO L290 TraceCheckUtils]: 236: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,277 INFO L290 TraceCheckUtils]: 237: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,277 INFO L290 TraceCheckUtils]: 238: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,278 INFO L290 TraceCheckUtils]: 239: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,278 INFO L290 TraceCheckUtils]: 240: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,278 INFO L290 TraceCheckUtils]: 241: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,279 INFO L290 TraceCheckUtils]: 242: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,279 INFO L290 TraceCheckUtils]: 243: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,279 INFO L290 TraceCheckUtils]: 244: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,280 INFO L290 TraceCheckUtils]: 245: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,280 INFO L290 TraceCheckUtils]: 246: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,280 INFO L290 TraceCheckUtils]: 247: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,281 INFO L290 TraceCheckUtils]: 248: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,281 INFO L290 TraceCheckUtils]: 249: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,281 INFO L290 TraceCheckUtils]: 250: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,282 INFO L290 TraceCheckUtils]: 251: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,282 INFO L290 TraceCheckUtils]: 252: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,282 INFO L290 TraceCheckUtils]: 253: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,283 INFO L290 TraceCheckUtils]: 254: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,283 INFO L290 TraceCheckUtils]: 255: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,284 INFO L290 TraceCheckUtils]: 256: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,284 INFO L290 TraceCheckUtils]: 257: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,284 INFO L290 TraceCheckUtils]: 258: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,285 INFO L290 TraceCheckUtils]: 259: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,285 INFO L290 TraceCheckUtils]: 260: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,285 INFO L290 TraceCheckUtils]: 261: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,286 INFO L290 TraceCheckUtils]: 262: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,286 INFO L290 TraceCheckUtils]: 263: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,286 INFO L290 TraceCheckUtils]: 264: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,287 INFO L290 TraceCheckUtils]: 265: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,287 INFO L290 TraceCheckUtils]: 266: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,287 INFO L290 TraceCheckUtils]: 267: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,288 INFO L290 TraceCheckUtils]: 268: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,288 INFO L290 TraceCheckUtils]: 269: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,288 INFO L290 TraceCheckUtils]: 270: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,289 INFO L290 TraceCheckUtils]: 271: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,289 INFO L290 TraceCheckUtils]: 272: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,289 INFO L290 TraceCheckUtils]: 273: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !(~j~0 < ~edgecount~0); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:04,290 INFO L290 TraceCheckUtils]: 274: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31629#(and (<= main_~i~0 4) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-08 03:36:04,290 INFO L290 TraceCheckUtils]: 275: Hoare triple {31629#(and (<= main_~i~0 4) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 < ~nodecount~0); {31620#false} is VALID [2022-04-08 03:36:04,290 INFO L290 TraceCheckUtils]: 276: Hoare triple {31620#false} ~i~0 := 0; {31620#false} is VALID [2022-04-08 03:36:04,290 INFO L290 TraceCheckUtils]: 277: Hoare triple {31620#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {31620#false} is VALID [2022-04-08 03:36:04,290 INFO L290 TraceCheckUtils]: 278: Hoare triple {31620#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {31620#false} is VALID [2022-04-08 03:36:04,290 INFO L290 TraceCheckUtils]: 279: Hoare triple {31620#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {31620#false} is VALID [2022-04-08 03:36:04,290 INFO L290 TraceCheckUtils]: 280: Hoare triple {31620#false} assume !(~i~0 < ~edgecount~0); {31620#false} is VALID [2022-04-08 03:36:04,290 INFO L290 TraceCheckUtils]: 281: Hoare triple {31620#false} ~i~0 := 0; {31620#false} is VALID [2022-04-08 03:36:04,290 INFO L290 TraceCheckUtils]: 282: Hoare triple {31620#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31620#false} is VALID [2022-04-08 03:36:04,290 INFO L272 TraceCheckUtils]: 283: Hoare triple {31620#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {31620#false} is VALID [2022-04-08 03:36:04,291 INFO L290 TraceCheckUtils]: 284: Hoare triple {31620#false} ~cond := #in~cond; {31620#false} is VALID [2022-04-08 03:36:04,291 INFO L290 TraceCheckUtils]: 285: Hoare triple {31620#false} assume 0 == ~cond; {31620#false} is VALID [2022-04-08 03:36:04,291 INFO L290 TraceCheckUtils]: 286: Hoare triple {31620#false} assume !false; {31620#false} is VALID [2022-04-08 03:36:04,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9858 backedges. 0 proven. 7462 refuted. 0 times theorem prover too weak. 2396 trivial. 0 not checked. [2022-04-08 03:36:04,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:36:04,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676552189] [2022-04-08 03:36:04,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676552189] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:36:04,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431708520] [2022-04-08 03:36:04,294 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:36:04,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:36:04,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:36:04,295 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:36:04,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-08 03:36:04,716 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:36:04,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:36:04,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 1564 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 03:36:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:04,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:36:05,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {31619#true} call ULTIMATE.init(); {31619#true} is VALID [2022-04-08 03:36:05,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {31619#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {31619#true} is VALID [2022-04-08 03:36:05,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-08 03:36:05,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31619#true} {31619#true} #107#return; {31619#true} is VALID [2022-04-08 03:36:05,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {31619#true} call #t~ret22 := main(); {31619#true} is VALID [2022-04-08 03:36:05,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {31619#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {31619#true} is VALID [2022-04-08 03:36:05,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 03:36:05,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {31619#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 03:36:05,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 03:36:05,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 03:36:05,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 03:36:05,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 03:36:05,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 03:36:05,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 03:36:05,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 03:36:05,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 03:36:05,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 03:36:05,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 03:36:05,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 03:36:05,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 03:36:05,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 03:36:05,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {31619#true} assume !(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 03:36:05,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {31619#true} ~i~0 := 0; {31619#true} is VALID [2022-04-08 03:36:05,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31703#(<= 0 main_~j~0)} is VALID [2022-04-08 03:36:05,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {31703#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31703#(<= 0 main_~j~0)} is VALID [2022-04-08 03:36:05,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {31703#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31703#(<= 0 main_~j~0)} is VALID [2022-04-08 03:36:05,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {31703#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31713#(<= 1 main_~j~0)} is VALID [2022-04-08 03:36:05,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {31713#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31713#(<= 1 main_~j~0)} is VALID [2022-04-08 03:36:05,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {31713#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31713#(<= 1 main_~j~0)} is VALID [2022-04-08 03:36:05,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {31713#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31723#(<= 2 main_~j~0)} is VALID [2022-04-08 03:36:05,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {31723#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31723#(<= 2 main_~j~0)} is VALID [2022-04-08 03:36:05,895 INFO L290 TraceCheckUtils]: 31: Hoare triple {31723#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31723#(<= 2 main_~j~0)} is VALID [2022-04-08 03:36:05,896 INFO L290 TraceCheckUtils]: 32: Hoare triple {31723#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31733#(<= 3 main_~j~0)} is VALID [2022-04-08 03:36:05,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {31733#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31733#(<= 3 main_~j~0)} is VALID [2022-04-08 03:36:05,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {31733#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31733#(<= 3 main_~j~0)} is VALID [2022-04-08 03:36:05,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {31733#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31743#(<= 4 main_~j~0)} is VALID [2022-04-08 03:36:05,897 INFO L290 TraceCheckUtils]: 36: Hoare triple {31743#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31743#(<= 4 main_~j~0)} is VALID [2022-04-08 03:36:05,897 INFO L290 TraceCheckUtils]: 37: Hoare triple {31743#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31743#(<= 4 main_~j~0)} is VALID [2022-04-08 03:36:05,897 INFO L290 TraceCheckUtils]: 38: Hoare triple {31743#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31753#(<= 5 main_~j~0)} is VALID [2022-04-08 03:36:05,898 INFO L290 TraceCheckUtils]: 39: Hoare triple {31753#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31753#(<= 5 main_~j~0)} is VALID [2022-04-08 03:36:05,898 INFO L290 TraceCheckUtils]: 40: Hoare triple {31753#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31753#(<= 5 main_~j~0)} is VALID [2022-04-08 03:36:05,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {31753#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31763#(<= 6 main_~j~0)} is VALID [2022-04-08 03:36:05,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {31763#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31763#(<= 6 main_~j~0)} is VALID [2022-04-08 03:36:05,899 INFO L290 TraceCheckUtils]: 43: Hoare triple {31763#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31763#(<= 6 main_~j~0)} is VALID [2022-04-08 03:36:05,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {31763#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31773#(<= 7 main_~j~0)} is VALID [2022-04-08 03:36:05,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {31773#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31773#(<= 7 main_~j~0)} is VALID [2022-04-08 03:36:05,899 INFO L290 TraceCheckUtils]: 46: Hoare triple {31773#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31773#(<= 7 main_~j~0)} is VALID [2022-04-08 03:36:05,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {31773#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31783#(<= 8 main_~j~0)} is VALID [2022-04-08 03:36:05,900 INFO L290 TraceCheckUtils]: 48: Hoare triple {31783#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31783#(<= 8 main_~j~0)} is VALID [2022-04-08 03:36:05,900 INFO L290 TraceCheckUtils]: 49: Hoare triple {31783#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31783#(<= 8 main_~j~0)} is VALID [2022-04-08 03:36:05,901 INFO L290 TraceCheckUtils]: 50: Hoare triple {31783#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31793#(<= 9 main_~j~0)} is VALID [2022-04-08 03:36:05,901 INFO L290 TraceCheckUtils]: 51: Hoare triple {31793#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31793#(<= 9 main_~j~0)} is VALID [2022-04-08 03:36:05,901 INFO L290 TraceCheckUtils]: 52: Hoare triple {31793#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31793#(<= 9 main_~j~0)} is VALID [2022-04-08 03:36:05,901 INFO L290 TraceCheckUtils]: 53: Hoare triple {31793#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31803#(<= 10 main_~j~0)} is VALID [2022-04-08 03:36:05,902 INFO L290 TraceCheckUtils]: 54: Hoare triple {31803#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31803#(<= 10 main_~j~0)} is VALID [2022-04-08 03:36:05,902 INFO L290 TraceCheckUtils]: 55: Hoare triple {31803#(<= 10 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31803#(<= 10 main_~j~0)} is VALID [2022-04-08 03:36:05,902 INFO L290 TraceCheckUtils]: 56: Hoare triple {31803#(<= 10 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31813#(<= 11 main_~j~0)} is VALID [2022-04-08 03:36:05,902 INFO L290 TraceCheckUtils]: 57: Hoare triple {31813#(<= 11 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31813#(<= 11 main_~j~0)} is VALID [2022-04-08 03:36:05,903 INFO L290 TraceCheckUtils]: 58: Hoare triple {31813#(<= 11 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31813#(<= 11 main_~j~0)} is VALID [2022-04-08 03:36:05,903 INFO L290 TraceCheckUtils]: 59: Hoare triple {31813#(<= 11 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31823#(<= 12 main_~j~0)} is VALID [2022-04-08 03:36:05,903 INFO L290 TraceCheckUtils]: 60: Hoare triple {31823#(<= 12 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31823#(<= 12 main_~j~0)} is VALID [2022-04-08 03:36:05,904 INFO L290 TraceCheckUtils]: 61: Hoare triple {31823#(<= 12 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31823#(<= 12 main_~j~0)} is VALID [2022-04-08 03:36:05,904 INFO L290 TraceCheckUtils]: 62: Hoare triple {31823#(<= 12 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31833#(<= 13 main_~j~0)} is VALID [2022-04-08 03:36:05,904 INFO L290 TraceCheckUtils]: 63: Hoare triple {31833#(<= 13 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31833#(<= 13 main_~j~0)} is VALID [2022-04-08 03:36:05,904 INFO L290 TraceCheckUtils]: 64: Hoare triple {31833#(<= 13 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31833#(<= 13 main_~j~0)} is VALID [2022-04-08 03:36:05,905 INFO L290 TraceCheckUtils]: 65: Hoare triple {31833#(<= 13 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31843#(<= 14 main_~j~0)} is VALID [2022-04-08 03:36:05,905 INFO L290 TraceCheckUtils]: 66: Hoare triple {31843#(<= 14 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31843#(<= 14 main_~j~0)} is VALID [2022-04-08 03:36:05,905 INFO L290 TraceCheckUtils]: 67: Hoare triple {31843#(<= 14 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31843#(<= 14 main_~j~0)} is VALID [2022-04-08 03:36:05,906 INFO L290 TraceCheckUtils]: 68: Hoare triple {31843#(<= 14 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31853#(<= 15 main_~j~0)} is VALID [2022-04-08 03:36:05,906 INFO L290 TraceCheckUtils]: 69: Hoare triple {31853#(<= 15 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31853#(<= 15 main_~j~0)} is VALID [2022-04-08 03:36:05,906 INFO L290 TraceCheckUtils]: 70: Hoare triple {31853#(<= 15 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31853#(<= 15 main_~j~0)} is VALID [2022-04-08 03:36:05,906 INFO L290 TraceCheckUtils]: 71: Hoare triple {31853#(<= 15 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31863#(<= 16 main_~j~0)} is VALID [2022-04-08 03:36:05,907 INFO L290 TraceCheckUtils]: 72: Hoare triple {31863#(<= 16 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31863#(<= 16 main_~j~0)} is VALID [2022-04-08 03:36:05,907 INFO L290 TraceCheckUtils]: 73: Hoare triple {31863#(<= 16 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31863#(<= 16 main_~j~0)} is VALID [2022-04-08 03:36:05,907 INFO L290 TraceCheckUtils]: 74: Hoare triple {31863#(<= 16 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31873#(<= 17 main_~j~0)} is VALID [2022-04-08 03:36:05,907 INFO L290 TraceCheckUtils]: 75: Hoare triple {31873#(<= 17 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31873#(<= 17 main_~j~0)} is VALID [2022-04-08 03:36:05,908 INFO L290 TraceCheckUtils]: 76: Hoare triple {31873#(<= 17 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31873#(<= 17 main_~j~0)} is VALID [2022-04-08 03:36:05,908 INFO L290 TraceCheckUtils]: 77: Hoare triple {31873#(<= 17 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31883#(<= 18 main_~j~0)} is VALID [2022-04-08 03:36:05,908 INFO L290 TraceCheckUtils]: 78: Hoare triple {31883#(<= 18 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31883#(<= 18 main_~j~0)} is VALID [2022-04-08 03:36:05,909 INFO L290 TraceCheckUtils]: 79: Hoare triple {31883#(<= 18 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31883#(<= 18 main_~j~0)} is VALID [2022-04-08 03:36:05,909 INFO L290 TraceCheckUtils]: 80: Hoare triple {31883#(<= 18 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31893#(<= 19 main_~j~0)} is VALID [2022-04-08 03:36:05,909 INFO L290 TraceCheckUtils]: 81: Hoare triple {31893#(<= 19 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,910 INFO L290 TraceCheckUtils]: 82: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,910 INFO L290 TraceCheckUtils]: 83: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,910 INFO L290 TraceCheckUtils]: 84: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,910 INFO L290 TraceCheckUtils]: 85: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,911 INFO L290 TraceCheckUtils]: 86: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,911 INFO L290 TraceCheckUtils]: 87: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,911 INFO L290 TraceCheckUtils]: 88: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,911 INFO L290 TraceCheckUtils]: 89: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,912 INFO L290 TraceCheckUtils]: 90: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,912 INFO L290 TraceCheckUtils]: 91: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,912 INFO L290 TraceCheckUtils]: 92: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,912 INFO L290 TraceCheckUtils]: 93: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,913 INFO L290 TraceCheckUtils]: 94: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,913 INFO L290 TraceCheckUtils]: 95: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,931 INFO L290 TraceCheckUtils]: 96: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,931 INFO L290 TraceCheckUtils]: 97: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,932 INFO L290 TraceCheckUtils]: 98: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,932 INFO L290 TraceCheckUtils]: 99: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,932 INFO L290 TraceCheckUtils]: 100: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,933 INFO L290 TraceCheckUtils]: 101: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,933 INFO L290 TraceCheckUtils]: 102: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,933 INFO L290 TraceCheckUtils]: 103: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,934 INFO L290 TraceCheckUtils]: 104: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,934 INFO L290 TraceCheckUtils]: 105: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,935 INFO L290 TraceCheckUtils]: 106: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,935 INFO L290 TraceCheckUtils]: 107: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,935 INFO L290 TraceCheckUtils]: 108: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,936 INFO L290 TraceCheckUtils]: 109: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,936 INFO L290 TraceCheckUtils]: 110: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,936 INFO L290 TraceCheckUtils]: 111: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,937 INFO L290 TraceCheckUtils]: 112: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,937 INFO L290 TraceCheckUtils]: 113: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,938 INFO L290 TraceCheckUtils]: 114: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,938 INFO L290 TraceCheckUtils]: 115: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,938 INFO L290 TraceCheckUtils]: 116: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,939 INFO L290 TraceCheckUtils]: 117: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,939 INFO L290 TraceCheckUtils]: 118: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,939 INFO L290 TraceCheckUtils]: 119: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,940 INFO L290 TraceCheckUtils]: 120: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,940 INFO L290 TraceCheckUtils]: 121: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,941 INFO L290 TraceCheckUtils]: 122: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,941 INFO L290 TraceCheckUtils]: 123: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,941 INFO L290 TraceCheckUtils]: 124: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,942 INFO L290 TraceCheckUtils]: 125: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,942 INFO L290 TraceCheckUtils]: 126: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,943 INFO L290 TraceCheckUtils]: 127: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,943 INFO L290 TraceCheckUtils]: 128: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,943 INFO L290 TraceCheckUtils]: 129: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,944 INFO L290 TraceCheckUtils]: 130: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,944 INFO L290 TraceCheckUtils]: 131: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,944 INFO L290 TraceCheckUtils]: 132: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,945 INFO L290 TraceCheckUtils]: 133: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,945 INFO L290 TraceCheckUtils]: 134: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,946 INFO L290 TraceCheckUtils]: 135: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,946 INFO L290 TraceCheckUtils]: 136: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,946 INFO L290 TraceCheckUtils]: 137: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,947 INFO L290 TraceCheckUtils]: 138: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,947 INFO L290 TraceCheckUtils]: 139: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,947 INFO L290 TraceCheckUtils]: 140: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,948 INFO L290 TraceCheckUtils]: 141: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,948 INFO L290 TraceCheckUtils]: 142: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,949 INFO L290 TraceCheckUtils]: 143: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,949 INFO L290 TraceCheckUtils]: 144: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,949 INFO L290 TraceCheckUtils]: 145: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,950 INFO L290 TraceCheckUtils]: 146: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,950 INFO L290 TraceCheckUtils]: 147: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,951 INFO L290 TraceCheckUtils]: 148: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,951 INFO L290 TraceCheckUtils]: 149: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,951 INFO L290 TraceCheckUtils]: 150: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,951 INFO L290 TraceCheckUtils]: 151: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,952 INFO L290 TraceCheckUtils]: 152: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,952 INFO L290 TraceCheckUtils]: 153: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,952 INFO L290 TraceCheckUtils]: 154: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,953 INFO L290 TraceCheckUtils]: 155: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,953 INFO L290 TraceCheckUtils]: 156: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,953 INFO L290 TraceCheckUtils]: 157: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,953 INFO L290 TraceCheckUtils]: 158: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,954 INFO L290 TraceCheckUtils]: 159: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,954 INFO L290 TraceCheckUtils]: 160: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,954 INFO L290 TraceCheckUtils]: 161: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,954 INFO L290 TraceCheckUtils]: 162: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,955 INFO L290 TraceCheckUtils]: 163: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,955 INFO L290 TraceCheckUtils]: 164: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,955 INFO L290 TraceCheckUtils]: 165: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,955 INFO L290 TraceCheckUtils]: 166: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,956 INFO L290 TraceCheckUtils]: 167: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,956 INFO L290 TraceCheckUtils]: 168: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,956 INFO L290 TraceCheckUtils]: 169: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,957 INFO L290 TraceCheckUtils]: 170: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,957 INFO L290 TraceCheckUtils]: 171: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,957 INFO L290 TraceCheckUtils]: 172: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,957 INFO L290 TraceCheckUtils]: 173: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,958 INFO L290 TraceCheckUtils]: 174: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,958 INFO L290 TraceCheckUtils]: 175: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,958 INFO L290 TraceCheckUtils]: 176: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,958 INFO L290 TraceCheckUtils]: 177: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,959 INFO L290 TraceCheckUtils]: 178: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,959 INFO L290 TraceCheckUtils]: 179: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,959 INFO L290 TraceCheckUtils]: 180: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,960 INFO L290 TraceCheckUtils]: 181: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,960 INFO L290 TraceCheckUtils]: 182: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,960 INFO L290 TraceCheckUtils]: 183: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,960 INFO L290 TraceCheckUtils]: 184: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,961 INFO L290 TraceCheckUtils]: 185: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,961 INFO L290 TraceCheckUtils]: 186: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,961 INFO L290 TraceCheckUtils]: 187: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,961 INFO L290 TraceCheckUtils]: 188: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,962 INFO L290 TraceCheckUtils]: 189: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,962 INFO L290 TraceCheckUtils]: 190: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,962 INFO L290 TraceCheckUtils]: 191: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,962 INFO L290 TraceCheckUtils]: 192: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,963 INFO L290 TraceCheckUtils]: 193: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,963 INFO L290 TraceCheckUtils]: 194: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,963 INFO L290 TraceCheckUtils]: 195: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,963 INFO L290 TraceCheckUtils]: 196: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,964 INFO L290 TraceCheckUtils]: 197: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,964 INFO L290 TraceCheckUtils]: 198: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,964 INFO L290 TraceCheckUtils]: 199: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,964 INFO L290 TraceCheckUtils]: 200: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,965 INFO L290 TraceCheckUtils]: 201: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,965 INFO L290 TraceCheckUtils]: 202: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,965 INFO L290 TraceCheckUtils]: 203: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,965 INFO L290 TraceCheckUtils]: 204: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,965 INFO L290 TraceCheckUtils]: 205: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,966 INFO L290 TraceCheckUtils]: 206: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,966 INFO L290 TraceCheckUtils]: 207: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,966 INFO L290 TraceCheckUtils]: 208: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,966 INFO L290 TraceCheckUtils]: 209: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,967 INFO L290 TraceCheckUtils]: 210: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,967 INFO L290 TraceCheckUtils]: 211: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,967 INFO L290 TraceCheckUtils]: 212: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,967 INFO L290 TraceCheckUtils]: 213: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,968 INFO L290 TraceCheckUtils]: 214: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,968 INFO L290 TraceCheckUtils]: 215: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,968 INFO L290 TraceCheckUtils]: 216: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,968 INFO L290 TraceCheckUtils]: 217: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,969 INFO L290 TraceCheckUtils]: 218: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,969 INFO L290 TraceCheckUtils]: 219: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,969 INFO L290 TraceCheckUtils]: 220: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,969 INFO L290 TraceCheckUtils]: 221: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,970 INFO L290 TraceCheckUtils]: 222: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,970 INFO L290 TraceCheckUtils]: 223: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,970 INFO L290 TraceCheckUtils]: 224: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,970 INFO L290 TraceCheckUtils]: 225: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,971 INFO L290 TraceCheckUtils]: 226: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,971 INFO L290 TraceCheckUtils]: 227: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,971 INFO L290 TraceCheckUtils]: 228: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,971 INFO L290 TraceCheckUtils]: 229: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,972 INFO L290 TraceCheckUtils]: 230: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,972 INFO L290 TraceCheckUtils]: 231: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,972 INFO L290 TraceCheckUtils]: 232: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,972 INFO L290 TraceCheckUtils]: 233: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,973 INFO L290 TraceCheckUtils]: 234: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,973 INFO L290 TraceCheckUtils]: 235: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,973 INFO L290 TraceCheckUtils]: 236: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,979 INFO L290 TraceCheckUtils]: 237: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,979 INFO L290 TraceCheckUtils]: 238: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,979 INFO L290 TraceCheckUtils]: 239: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,979 INFO L290 TraceCheckUtils]: 240: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,980 INFO L290 TraceCheckUtils]: 241: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,980 INFO L290 TraceCheckUtils]: 242: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,980 INFO L290 TraceCheckUtils]: 243: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,981 INFO L290 TraceCheckUtils]: 244: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,981 INFO L290 TraceCheckUtils]: 245: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,981 INFO L290 TraceCheckUtils]: 246: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,981 INFO L290 TraceCheckUtils]: 247: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,982 INFO L290 TraceCheckUtils]: 248: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,982 INFO L290 TraceCheckUtils]: 249: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,982 INFO L290 TraceCheckUtils]: 250: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,982 INFO L290 TraceCheckUtils]: 251: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,983 INFO L290 TraceCheckUtils]: 252: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,983 INFO L290 TraceCheckUtils]: 253: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,983 INFO L290 TraceCheckUtils]: 254: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,983 INFO L290 TraceCheckUtils]: 255: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,984 INFO L290 TraceCheckUtils]: 256: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,984 INFO L290 TraceCheckUtils]: 257: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,984 INFO L290 TraceCheckUtils]: 258: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,984 INFO L290 TraceCheckUtils]: 259: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,985 INFO L290 TraceCheckUtils]: 260: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,985 INFO L290 TraceCheckUtils]: 261: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,985 INFO L290 TraceCheckUtils]: 262: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,986 INFO L290 TraceCheckUtils]: 263: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,986 INFO L290 TraceCheckUtils]: 264: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,986 INFO L290 TraceCheckUtils]: 265: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,986 INFO L290 TraceCheckUtils]: 266: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,987 INFO L290 TraceCheckUtils]: 267: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,987 INFO L290 TraceCheckUtils]: 268: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,987 INFO L290 TraceCheckUtils]: 269: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,987 INFO L290 TraceCheckUtils]: 270: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,988 INFO L290 TraceCheckUtils]: 271: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,988 INFO L290 TraceCheckUtils]: 272: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,988 INFO L290 TraceCheckUtils]: 273: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,988 INFO L290 TraceCheckUtils]: 274: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,989 INFO L290 TraceCheckUtils]: 275: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:05,989 INFO L290 TraceCheckUtils]: 276: Hoare triple {31897#(< 19 main_~edgecount~0)} ~i~0 := 0; {32483#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 03:36:05,990 INFO L290 TraceCheckUtils]: 277: Hoare triple {32483#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {32483#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 03:36:05,990 INFO L290 TraceCheckUtils]: 278: Hoare triple {32483#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {32483#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 03:36:05,990 INFO L290 TraceCheckUtils]: 279: Hoare triple {32483#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {32493#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 03:36:05,991 INFO L290 TraceCheckUtils]: 280: Hoare triple {32493#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~edgecount~0); {31620#false} is VALID [2022-04-08 03:36:05,991 INFO L290 TraceCheckUtils]: 281: Hoare triple {31620#false} ~i~0 := 0; {31620#false} is VALID [2022-04-08 03:36:05,991 INFO L290 TraceCheckUtils]: 282: Hoare triple {31620#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31620#false} is VALID [2022-04-08 03:36:05,991 INFO L272 TraceCheckUtils]: 283: Hoare triple {31620#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {31620#false} is VALID [2022-04-08 03:36:05,991 INFO L290 TraceCheckUtils]: 284: Hoare triple {31620#false} ~cond := #in~cond; {31620#false} is VALID [2022-04-08 03:36:05,991 INFO L290 TraceCheckUtils]: 285: Hoare triple {31620#false} assume 0 == ~cond; {31620#false} is VALID [2022-04-08 03:36:05,991 INFO L290 TraceCheckUtils]: 286: Hoare triple {31620#false} assume !false; {31620#false} is VALID [2022-04-08 03:36:05,994 INFO L134 CoverageAnalysis]: Checked inductivity of 9858 backedges. 536 proven. 3599 refuted. 0 times theorem prover too weak. 5723 trivial. 0 not checked. [2022-04-08 03:36:05,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:36:07,175 INFO L290 TraceCheckUtils]: 286: Hoare triple {31620#false} assume !false; {31620#false} is VALID [2022-04-08 03:36:07,175 INFO L290 TraceCheckUtils]: 285: Hoare triple {31620#false} assume 0 == ~cond; {31620#false} is VALID [2022-04-08 03:36:07,175 INFO L290 TraceCheckUtils]: 284: Hoare triple {31620#false} ~cond := #in~cond; {31620#false} is VALID [2022-04-08 03:36:07,175 INFO L272 TraceCheckUtils]: 283: Hoare triple {31620#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {31620#false} is VALID [2022-04-08 03:36:07,175 INFO L290 TraceCheckUtils]: 282: Hoare triple {31620#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31620#false} is VALID [2022-04-08 03:36:07,175 INFO L290 TraceCheckUtils]: 281: Hoare triple {31620#false} ~i~0 := 0; {31620#false} is VALID [2022-04-08 03:36:07,175 INFO L290 TraceCheckUtils]: 280: Hoare triple {32533#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {31620#false} is VALID [2022-04-08 03:36:07,176 INFO L290 TraceCheckUtils]: 279: Hoare triple {32537#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {32533#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,176 INFO L290 TraceCheckUtils]: 278: Hoare triple {32537#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {32537#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:07,176 INFO L290 TraceCheckUtils]: 277: Hoare triple {32537#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {32537#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:07,177 INFO L290 TraceCheckUtils]: 276: Hoare triple {32547#(< 1 main_~edgecount~0)} ~i~0 := 0; {32537#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:07,177 INFO L290 TraceCheckUtils]: 275: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,177 INFO L290 TraceCheckUtils]: 274: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,177 INFO L290 TraceCheckUtils]: 273: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,178 INFO L290 TraceCheckUtils]: 272: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,178 INFO L290 TraceCheckUtils]: 271: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,178 INFO L290 TraceCheckUtils]: 270: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,178 INFO L290 TraceCheckUtils]: 269: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,178 INFO L290 TraceCheckUtils]: 268: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,179 INFO L290 TraceCheckUtils]: 267: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,179 INFO L290 TraceCheckUtils]: 266: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,179 INFO L290 TraceCheckUtils]: 265: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,179 INFO L290 TraceCheckUtils]: 264: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,180 INFO L290 TraceCheckUtils]: 263: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,180 INFO L290 TraceCheckUtils]: 262: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,180 INFO L290 TraceCheckUtils]: 261: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,180 INFO L290 TraceCheckUtils]: 260: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,181 INFO L290 TraceCheckUtils]: 259: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,181 INFO L290 TraceCheckUtils]: 258: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,181 INFO L290 TraceCheckUtils]: 257: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,181 INFO L290 TraceCheckUtils]: 256: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,182 INFO L290 TraceCheckUtils]: 255: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,182 INFO L290 TraceCheckUtils]: 254: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,182 INFO L290 TraceCheckUtils]: 253: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,182 INFO L290 TraceCheckUtils]: 252: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,182 INFO L290 TraceCheckUtils]: 251: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,183 INFO L290 TraceCheckUtils]: 250: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,183 INFO L290 TraceCheckUtils]: 249: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,183 INFO L290 TraceCheckUtils]: 248: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,183 INFO L290 TraceCheckUtils]: 247: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,184 INFO L290 TraceCheckUtils]: 246: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,184 INFO L290 TraceCheckUtils]: 245: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,184 INFO L290 TraceCheckUtils]: 244: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,184 INFO L290 TraceCheckUtils]: 243: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,185 INFO L290 TraceCheckUtils]: 242: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,185 INFO L290 TraceCheckUtils]: 241: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,185 INFO L290 TraceCheckUtils]: 240: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,185 INFO L290 TraceCheckUtils]: 239: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,186 INFO L290 TraceCheckUtils]: 238: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,186 INFO L290 TraceCheckUtils]: 237: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,186 INFO L290 TraceCheckUtils]: 236: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,186 INFO L290 TraceCheckUtils]: 235: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,186 INFO L290 TraceCheckUtils]: 234: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,187 INFO L290 TraceCheckUtils]: 233: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,187 INFO L290 TraceCheckUtils]: 232: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,187 INFO L290 TraceCheckUtils]: 231: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,187 INFO L290 TraceCheckUtils]: 230: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,188 INFO L290 TraceCheckUtils]: 229: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,188 INFO L290 TraceCheckUtils]: 228: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,188 INFO L290 TraceCheckUtils]: 227: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,188 INFO L290 TraceCheckUtils]: 226: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,189 INFO L290 TraceCheckUtils]: 225: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,189 INFO L290 TraceCheckUtils]: 224: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,189 INFO L290 TraceCheckUtils]: 223: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,189 INFO L290 TraceCheckUtils]: 222: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,190 INFO L290 TraceCheckUtils]: 221: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,190 INFO L290 TraceCheckUtils]: 220: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,190 INFO L290 TraceCheckUtils]: 219: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,190 INFO L290 TraceCheckUtils]: 218: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,190 INFO L290 TraceCheckUtils]: 217: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,191 INFO L290 TraceCheckUtils]: 216: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,191 INFO L290 TraceCheckUtils]: 215: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,191 INFO L290 TraceCheckUtils]: 214: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,191 INFO L290 TraceCheckUtils]: 213: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,192 INFO L290 TraceCheckUtils]: 212: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,192 INFO L290 TraceCheckUtils]: 211: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,192 INFO L290 TraceCheckUtils]: 210: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,192 INFO L290 TraceCheckUtils]: 209: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,193 INFO L290 TraceCheckUtils]: 208: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,193 INFO L290 TraceCheckUtils]: 207: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,193 INFO L290 TraceCheckUtils]: 206: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,193 INFO L290 TraceCheckUtils]: 205: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,194 INFO L290 TraceCheckUtils]: 204: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,194 INFO L290 TraceCheckUtils]: 203: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,194 INFO L290 TraceCheckUtils]: 202: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,194 INFO L290 TraceCheckUtils]: 201: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,195 INFO L290 TraceCheckUtils]: 200: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,195 INFO L290 TraceCheckUtils]: 199: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,195 INFO L290 TraceCheckUtils]: 198: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,195 INFO L290 TraceCheckUtils]: 197: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,196 INFO L290 TraceCheckUtils]: 196: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,196 INFO L290 TraceCheckUtils]: 195: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,196 INFO L290 TraceCheckUtils]: 194: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,196 INFO L290 TraceCheckUtils]: 193: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,197 INFO L290 TraceCheckUtils]: 192: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,197 INFO L290 TraceCheckUtils]: 191: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,197 INFO L290 TraceCheckUtils]: 190: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,197 INFO L290 TraceCheckUtils]: 189: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,197 INFO L290 TraceCheckUtils]: 188: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,198 INFO L290 TraceCheckUtils]: 187: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,198 INFO L290 TraceCheckUtils]: 186: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,198 INFO L290 TraceCheckUtils]: 185: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,198 INFO L290 TraceCheckUtils]: 184: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,199 INFO L290 TraceCheckUtils]: 183: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,199 INFO L290 TraceCheckUtils]: 182: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,199 INFO L290 TraceCheckUtils]: 181: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,199 INFO L290 TraceCheckUtils]: 180: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,200 INFO L290 TraceCheckUtils]: 179: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,200 INFO L290 TraceCheckUtils]: 178: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,200 INFO L290 TraceCheckUtils]: 177: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,200 INFO L290 TraceCheckUtils]: 176: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,201 INFO L290 TraceCheckUtils]: 175: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,201 INFO L290 TraceCheckUtils]: 174: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,201 INFO L290 TraceCheckUtils]: 173: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,201 INFO L290 TraceCheckUtils]: 172: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,201 INFO L290 TraceCheckUtils]: 171: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,202 INFO L290 TraceCheckUtils]: 170: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,202 INFO L290 TraceCheckUtils]: 169: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,202 INFO L290 TraceCheckUtils]: 168: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,202 INFO L290 TraceCheckUtils]: 167: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,203 INFO L290 TraceCheckUtils]: 166: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,203 INFO L290 TraceCheckUtils]: 165: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,203 INFO L290 TraceCheckUtils]: 164: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,203 INFO L290 TraceCheckUtils]: 163: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,204 INFO L290 TraceCheckUtils]: 162: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,204 INFO L290 TraceCheckUtils]: 161: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,204 INFO L290 TraceCheckUtils]: 160: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,204 INFO L290 TraceCheckUtils]: 159: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,205 INFO L290 TraceCheckUtils]: 158: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,205 INFO L290 TraceCheckUtils]: 157: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,205 INFO L290 TraceCheckUtils]: 156: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,205 INFO L290 TraceCheckUtils]: 155: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,205 INFO L290 TraceCheckUtils]: 154: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,206 INFO L290 TraceCheckUtils]: 153: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,206 INFO L290 TraceCheckUtils]: 152: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,206 INFO L290 TraceCheckUtils]: 151: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,206 INFO L290 TraceCheckUtils]: 150: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,207 INFO L290 TraceCheckUtils]: 149: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,207 INFO L290 TraceCheckUtils]: 148: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,207 INFO L290 TraceCheckUtils]: 147: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,207 INFO L290 TraceCheckUtils]: 146: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,208 INFO L290 TraceCheckUtils]: 145: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,208 INFO L290 TraceCheckUtils]: 144: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,208 INFO L290 TraceCheckUtils]: 143: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,208 INFO L290 TraceCheckUtils]: 142: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,209 INFO L290 TraceCheckUtils]: 141: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,209 INFO L290 TraceCheckUtils]: 140: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,209 INFO L290 TraceCheckUtils]: 139: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,209 INFO L290 TraceCheckUtils]: 138: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,210 INFO L290 TraceCheckUtils]: 137: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,210 INFO L290 TraceCheckUtils]: 136: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,210 INFO L290 TraceCheckUtils]: 135: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,210 INFO L290 TraceCheckUtils]: 134: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,210 INFO L290 TraceCheckUtils]: 133: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,211 INFO L290 TraceCheckUtils]: 132: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,211 INFO L290 TraceCheckUtils]: 131: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,211 INFO L290 TraceCheckUtils]: 130: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,211 INFO L290 TraceCheckUtils]: 129: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,212 INFO L290 TraceCheckUtils]: 128: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,212 INFO L290 TraceCheckUtils]: 127: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,212 INFO L290 TraceCheckUtils]: 126: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,212 INFO L290 TraceCheckUtils]: 125: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,213 INFO L290 TraceCheckUtils]: 124: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,213 INFO L290 TraceCheckUtils]: 123: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,213 INFO L290 TraceCheckUtils]: 122: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,213 INFO L290 TraceCheckUtils]: 121: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,214 INFO L290 TraceCheckUtils]: 120: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,214 INFO L290 TraceCheckUtils]: 119: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,214 INFO L290 TraceCheckUtils]: 118: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,214 INFO L290 TraceCheckUtils]: 117: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,215 INFO L290 TraceCheckUtils]: 116: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,215 INFO L290 TraceCheckUtils]: 115: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,215 INFO L290 TraceCheckUtils]: 114: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,215 INFO L290 TraceCheckUtils]: 113: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,216 INFO L290 TraceCheckUtils]: 112: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,216 INFO L290 TraceCheckUtils]: 111: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,216 INFO L290 TraceCheckUtils]: 110: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,216 INFO L290 TraceCheckUtils]: 109: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,216 INFO L290 TraceCheckUtils]: 108: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,217 INFO L290 TraceCheckUtils]: 107: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,217 INFO L290 TraceCheckUtils]: 106: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,217 INFO L290 TraceCheckUtils]: 105: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,217 INFO L290 TraceCheckUtils]: 104: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,218 INFO L290 TraceCheckUtils]: 103: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,218 INFO L290 TraceCheckUtils]: 102: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,218 INFO L290 TraceCheckUtils]: 101: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,218 INFO L290 TraceCheckUtils]: 100: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,219 INFO L290 TraceCheckUtils]: 99: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,219 INFO L290 TraceCheckUtils]: 98: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,219 INFO L290 TraceCheckUtils]: 97: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,219 INFO L290 TraceCheckUtils]: 96: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,220 INFO L290 TraceCheckUtils]: 95: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,220 INFO L290 TraceCheckUtils]: 94: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,220 INFO L290 TraceCheckUtils]: 93: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,220 INFO L290 TraceCheckUtils]: 92: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,221 INFO L290 TraceCheckUtils]: 91: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,221 INFO L290 TraceCheckUtils]: 90: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,221 INFO L290 TraceCheckUtils]: 89: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,221 INFO L290 TraceCheckUtils]: 88: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,221 INFO L290 TraceCheckUtils]: 87: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,222 INFO L290 TraceCheckUtils]: 86: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,222 INFO L290 TraceCheckUtils]: 85: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,222 INFO L290 TraceCheckUtils]: 84: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,222 INFO L290 TraceCheckUtils]: 83: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,223 INFO L290 TraceCheckUtils]: 82: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,223 INFO L290 TraceCheckUtils]: 81: Hoare triple {31713#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:07,224 INFO L290 TraceCheckUtils]: 80: Hoare triple {31703#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31713#(<= 1 main_~j~0)} is VALID [2022-04-08 03:36:07,224 INFO L290 TraceCheckUtils]: 79: Hoare triple {31703#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31703#(<= 0 main_~j~0)} is VALID [2022-04-08 03:36:07,224 INFO L290 TraceCheckUtils]: 78: Hoare triple {31703#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31703#(<= 0 main_~j~0)} is VALID [2022-04-08 03:36:07,224 INFO L290 TraceCheckUtils]: 77: Hoare triple {33145#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31703#(<= 0 main_~j~0)} is VALID [2022-04-08 03:36:07,225 INFO L290 TraceCheckUtils]: 76: Hoare triple {33145#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33145#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:36:07,225 INFO L290 TraceCheckUtils]: 75: Hoare triple {33145#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33145#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:36:07,225 INFO L290 TraceCheckUtils]: 74: Hoare triple {33155#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33145#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:36:07,226 INFO L290 TraceCheckUtils]: 73: Hoare triple {33155#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33155#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:36:07,226 INFO L290 TraceCheckUtils]: 72: Hoare triple {33155#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33155#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:36:07,226 INFO L290 TraceCheckUtils]: 71: Hoare triple {33165#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33155#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:36:07,227 INFO L290 TraceCheckUtils]: 70: Hoare triple {33165#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33165#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:36:07,227 INFO L290 TraceCheckUtils]: 69: Hoare triple {33165#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33165#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:36:07,228 INFO L290 TraceCheckUtils]: 68: Hoare triple {33175#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33165#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:36:07,228 INFO L290 TraceCheckUtils]: 67: Hoare triple {33175#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33175#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:36:07,228 INFO L290 TraceCheckUtils]: 66: Hoare triple {33175#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33175#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:36:07,228 INFO L290 TraceCheckUtils]: 65: Hoare triple {33185#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33175#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:36:07,229 INFO L290 TraceCheckUtils]: 64: Hoare triple {33185#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33185#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:36:07,229 INFO L290 TraceCheckUtils]: 63: Hoare triple {33185#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33185#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:36:07,229 INFO L290 TraceCheckUtils]: 62: Hoare triple {33195#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33185#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:36:07,230 INFO L290 TraceCheckUtils]: 61: Hoare triple {33195#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33195#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:36:07,230 INFO L290 TraceCheckUtils]: 60: Hoare triple {33195#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33195#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:36:07,230 INFO L290 TraceCheckUtils]: 59: Hoare triple {33205#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33195#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:36:07,231 INFO L290 TraceCheckUtils]: 58: Hoare triple {33205#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33205#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:36:07,231 INFO L290 TraceCheckUtils]: 57: Hoare triple {33205#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33205#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:36:07,231 INFO L290 TraceCheckUtils]: 56: Hoare triple {33215#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33205#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:36:07,232 INFO L290 TraceCheckUtils]: 55: Hoare triple {33215#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33215#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:36:07,232 INFO L290 TraceCheckUtils]: 54: Hoare triple {33215#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33215#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:36:07,232 INFO L290 TraceCheckUtils]: 53: Hoare triple {33225#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33215#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:36:07,232 INFO L290 TraceCheckUtils]: 52: Hoare triple {33225#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33225#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:36:07,233 INFO L290 TraceCheckUtils]: 51: Hoare triple {33225#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33225#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:36:07,233 INFO L290 TraceCheckUtils]: 50: Hoare triple {33235#(<= 0 (+ main_~j~0 10))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33225#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:36:07,234 INFO L290 TraceCheckUtils]: 49: Hoare triple {33235#(<= 0 (+ main_~j~0 10))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33235#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 03:36:07,234 INFO L290 TraceCheckUtils]: 48: Hoare triple {33235#(<= 0 (+ main_~j~0 10))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33235#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 03:36:07,234 INFO L290 TraceCheckUtils]: 47: Hoare triple {33245#(<= 0 (+ main_~j~0 11))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33235#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 03:36:07,234 INFO L290 TraceCheckUtils]: 46: Hoare triple {33245#(<= 0 (+ main_~j~0 11))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33245#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 03:36:07,235 INFO L290 TraceCheckUtils]: 45: Hoare triple {33245#(<= 0 (+ main_~j~0 11))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33245#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 03:36:07,235 INFO L290 TraceCheckUtils]: 44: Hoare triple {33255#(<= 0 (+ main_~j~0 12))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33245#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 03:36:07,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {33255#(<= 0 (+ main_~j~0 12))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33255#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 03:36:07,235 INFO L290 TraceCheckUtils]: 42: Hoare triple {33255#(<= 0 (+ main_~j~0 12))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33255#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 03:36:07,236 INFO L290 TraceCheckUtils]: 41: Hoare triple {33265#(<= 0 (+ main_~j~0 13))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33255#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 03:36:07,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {33265#(<= 0 (+ main_~j~0 13))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33265#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 03:36:07,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {33265#(<= 0 (+ main_~j~0 13))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33265#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 03:36:07,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {33275#(<= 0 (+ main_~j~0 14))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33265#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 03:36:07,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {33275#(<= 0 (+ main_~j~0 14))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33275#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 03:36:07,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {33275#(<= 0 (+ main_~j~0 14))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33275#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 03:36:07,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {33285#(<= 0 (+ main_~j~0 15))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33275#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 03:36:07,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {33285#(<= 0 (+ main_~j~0 15))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33285#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 03:36:07,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {33285#(<= 0 (+ main_~j~0 15))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33285#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 03:36:07,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {33295#(<= 0 (+ main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33285#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 03:36:07,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {33295#(<= 0 (+ main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33295#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-08 03:36:07,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {33295#(<= 0 (+ main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33295#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-08 03:36:07,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {33305#(<= 0 (+ main_~j~0 17))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33295#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-08 03:36:07,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {33305#(<= 0 (+ main_~j~0 17))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33305#(<= 0 (+ main_~j~0 17))} is VALID [2022-04-08 03:36:07,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {33305#(<= 0 (+ main_~j~0 17))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33305#(<= 0 (+ main_~j~0 17))} is VALID [2022-04-08 03:36:07,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {33315#(<= 0 (+ main_~j~0 18))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33305#(<= 0 (+ main_~j~0 17))} is VALID [2022-04-08 03:36:07,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {33315#(<= 0 (+ main_~j~0 18))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33315#(<= 0 (+ main_~j~0 18))} is VALID [2022-04-08 03:36:07,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {33315#(<= 0 (+ main_~j~0 18))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33315#(<= 0 (+ main_~j~0 18))} is VALID [2022-04-08 03:36:07,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {33315#(<= 0 (+ main_~j~0 18))} is VALID [2022-04-08 03:36:07,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {31619#true} ~i~0 := 0; {31619#true} is VALID [2022-04-08 03:36:07,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {31619#true} assume !(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 03:36:07,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 03:36:07,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 03:36:07,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 03:36:07,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 03:36:07,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 03:36:07,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 03:36:07,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 03:36:07,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 03:36:07,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 03:36:07,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 03:36:07,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 03:36:07,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 03:36:07,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-08 03:36:07,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {31619#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-08 03:36:07,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-08 03:36:07,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {31619#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {31619#true} is VALID [2022-04-08 03:36:07,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {31619#true} call #t~ret22 := main(); {31619#true} is VALID [2022-04-08 03:36:07,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31619#true} {31619#true} #107#return; {31619#true} is VALID [2022-04-08 03:36:07,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-08 03:36:07,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {31619#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {31619#true} is VALID [2022-04-08 03:36:07,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {31619#true} call ULTIMATE.init(); {31619#true} is VALID [2022-04-08 03:36:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9858 backedges. 536 proven. 3599 refuted. 0 times theorem prover too weak. 5723 trivial. 0 not checked. [2022-04-08 03:36:07,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431708520] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:36:07,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:36:07,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 25, 25] total 53 [2022-04-08 03:36:07,245 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:36:07,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1789051240] [2022-04-08 03:36:07,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1789051240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:36:07,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:36:07,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 03:36:07,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443825901] [2022-04-08 03:36:07,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:36:07,245 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 287 [2022-04-08 03:36:07,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:36:07,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:07,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:07,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 03:36:07,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:07,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 03:36:07,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=832, Invalid=1924, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 03:36:07,282 INFO L87 Difference]: Start difference. First operand 292 states and 380 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:09,108 INFO L93 Difference]: Finished difference Result 406 states and 525 transitions. [2022-04-08 03:36:09,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:36:09,108 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 287 [2022-04-08 03:36:09,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:36:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2022-04-08 03:36:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2022-04-08 03:36:09,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 139 transitions. [2022-04-08 03:36:09,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:09,230 INFO L225 Difference]: With dead ends: 406 [2022-04-08 03:36:09,230 INFO L226 Difference]: Without dead ends: 390 [2022-04-08 03:36:09,231 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=886, Invalid=2536, Unknown=0, NotChecked=0, Total=3422 [2022-04-08 03:36:09,231 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 206 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:36:09,231 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 39 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:36:09,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-04-08 03:36:10,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 355. [2022-04-08 03:36:10,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:36:10,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 390 states. Second operand has 355 states, 349 states have (on average 1.3151862464183381) internal successors, (459), 349 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:10,669 INFO L74 IsIncluded]: Start isIncluded. First operand 390 states. Second operand has 355 states, 349 states have (on average 1.3151862464183381) internal successors, (459), 349 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:10,669 INFO L87 Difference]: Start difference. First operand 390 states. Second operand has 355 states, 349 states have (on average 1.3151862464183381) internal successors, (459), 349 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:10,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:10,676 INFO L93 Difference]: Finished difference Result 390 states and 507 transitions. [2022-04-08 03:36:10,676 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 507 transitions. [2022-04-08 03:36:10,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:10,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:10,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 355 states, 349 states have (on average 1.3151862464183381) internal successors, (459), 349 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 390 states. [2022-04-08 03:36:10,677 INFO L87 Difference]: Start difference. First operand has 355 states, 349 states have (on average 1.3151862464183381) internal successors, (459), 349 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 390 states. [2022-04-08 03:36:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:10,688 INFO L93 Difference]: Finished difference Result 390 states and 507 transitions. [2022-04-08 03:36:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 507 transitions. [2022-04-08 03:36:10,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:10,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:10,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:36:10,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:36:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 349 states have (on average 1.3151862464183381) internal successors, (459), 349 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 464 transitions. [2022-04-08 03:36:10,695 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 464 transitions. Word has length 287 [2022-04-08 03:36:10,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:36:10,695 INFO L478 AbstractCegarLoop]: Abstraction has 355 states and 464 transitions. [2022-04-08 03:36:10,695 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:10,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 355 states and 464 transitions. [2022-04-08 03:36:11,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 464 edges. 464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 464 transitions. [2022-04-08 03:36:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2022-04-08 03:36:11,624 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:36:11,624 INFO L499 BasicCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:36:11,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-08 03:36:11,842 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:36:11,843 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:36:11,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:36:11,843 INFO L85 PathProgramCache]: Analyzing trace with hash 587258522, now seen corresponding path program 53 times [2022-04-08 03:36:11,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:11,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1926348720] [2022-04-08 03:36:11,851 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:36:11,851 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:36:11,851 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:36:11,851 INFO L85 PathProgramCache]: Analyzing trace with hash 587258522, now seen corresponding path program 54 times [2022-04-08 03:36:11,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:36:11,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801527453] [2022-04-08 03:36:11,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:36:11,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:36:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:12,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:36:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:12,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {35718#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {35710#true} is VALID [2022-04-08 03:36:12,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {35710#true} assume true; {35710#true} is VALID [2022-04-08 03:36:12,140 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35710#true} {35710#true} #107#return; {35710#true} is VALID [2022-04-08 03:36:12,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {35710#true} call ULTIMATE.init(); {35718#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:36:12,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {35718#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {35710#true} is VALID [2022-04-08 03:36:12,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {35710#true} assume true; {35710#true} is VALID [2022-04-08 03:36:12,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35710#true} {35710#true} #107#return; {35710#true} is VALID [2022-04-08 03:36:12,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {35710#true} call #t~ret22 := main(); {35710#true} is VALID [2022-04-08 03:36:12,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {35710#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,147 INFO L290 TraceCheckUtils]: 28: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,147 INFO L290 TraceCheckUtils]: 29: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,147 INFO L290 TraceCheckUtils]: 32: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,148 INFO L290 TraceCheckUtils]: 33: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,148 INFO L290 TraceCheckUtils]: 36: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,148 INFO L290 TraceCheckUtils]: 37: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,149 INFO L290 TraceCheckUtils]: 39: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,149 INFO L290 TraceCheckUtils]: 41: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,150 INFO L290 TraceCheckUtils]: 43: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,150 INFO L290 TraceCheckUtils]: 44: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,150 INFO L290 TraceCheckUtils]: 45: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,151 INFO L290 TraceCheckUtils]: 47: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,151 INFO L290 TraceCheckUtils]: 48: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,151 INFO L290 TraceCheckUtils]: 49: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,151 INFO L290 TraceCheckUtils]: 50: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,151 INFO L290 TraceCheckUtils]: 51: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,152 INFO L290 TraceCheckUtils]: 52: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,152 INFO L290 TraceCheckUtils]: 53: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,152 INFO L290 TraceCheckUtils]: 54: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,152 INFO L290 TraceCheckUtils]: 55: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,153 INFO L290 TraceCheckUtils]: 56: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,153 INFO L290 TraceCheckUtils]: 57: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,153 INFO L290 TraceCheckUtils]: 58: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,153 INFO L290 TraceCheckUtils]: 59: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,153 INFO L290 TraceCheckUtils]: 60: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,154 INFO L290 TraceCheckUtils]: 61: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,154 INFO L290 TraceCheckUtils]: 62: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,154 INFO L290 TraceCheckUtils]: 63: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,154 INFO L290 TraceCheckUtils]: 64: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,154 INFO L290 TraceCheckUtils]: 65: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,155 INFO L290 TraceCheckUtils]: 66: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,155 INFO L290 TraceCheckUtils]: 67: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,155 INFO L290 TraceCheckUtils]: 68: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,155 INFO L290 TraceCheckUtils]: 69: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,156 INFO L290 TraceCheckUtils]: 70: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,156 INFO L290 TraceCheckUtils]: 71: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,156 INFO L290 TraceCheckUtils]: 72: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,156 INFO L290 TraceCheckUtils]: 73: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,156 INFO L290 TraceCheckUtils]: 74: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,157 INFO L290 TraceCheckUtils]: 75: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,157 INFO L290 TraceCheckUtils]: 76: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,157 INFO L290 TraceCheckUtils]: 77: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,157 INFO L290 TraceCheckUtils]: 78: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,157 INFO L290 TraceCheckUtils]: 79: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,158 INFO L290 TraceCheckUtils]: 80: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,158 INFO L290 TraceCheckUtils]: 81: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,158 INFO L290 TraceCheckUtils]: 82: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,158 INFO L290 TraceCheckUtils]: 83: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,159 INFO L290 TraceCheckUtils]: 84: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,159 INFO L290 TraceCheckUtils]: 85: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,159 INFO L290 TraceCheckUtils]: 86: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,159 INFO L290 TraceCheckUtils]: 87: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,159 INFO L290 TraceCheckUtils]: 88: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,160 INFO L290 TraceCheckUtils]: 89: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,160 INFO L290 TraceCheckUtils]: 90: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,160 INFO L290 TraceCheckUtils]: 91: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,160 INFO L290 TraceCheckUtils]: 92: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,160 INFO L290 TraceCheckUtils]: 93: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,161 INFO L290 TraceCheckUtils]: 94: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,161 INFO L290 TraceCheckUtils]: 95: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,161 INFO L290 TraceCheckUtils]: 96: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,161 INFO L290 TraceCheckUtils]: 97: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,161 INFO L290 TraceCheckUtils]: 98: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,162 INFO L290 TraceCheckUtils]: 99: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,162 INFO L290 TraceCheckUtils]: 100: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,162 INFO L290 TraceCheckUtils]: 101: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,162 INFO L290 TraceCheckUtils]: 102: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,163 INFO L290 TraceCheckUtils]: 103: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,163 INFO L290 TraceCheckUtils]: 104: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,163 INFO L290 TraceCheckUtils]: 105: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,163 INFO L290 TraceCheckUtils]: 106: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,163 INFO L290 TraceCheckUtils]: 107: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,164 INFO L290 TraceCheckUtils]: 108: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,164 INFO L290 TraceCheckUtils]: 109: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,164 INFO L290 TraceCheckUtils]: 110: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,164 INFO L290 TraceCheckUtils]: 111: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,164 INFO L290 TraceCheckUtils]: 112: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,165 INFO L290 TraceCheckUtils]: 113: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,165 INFO L290 TraceCheckUtils]: 114: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,165 INFO L290 TraceCheckUtils]: 115: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,165 INFO L290 TraceCheckUtils]: 116: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,165 INFO L290 TraceCheckUtils]: 117: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,166 INFO L290 TraceCheckUtils]: 118: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,166 INFO L290 TraceCheckUtils]: 119: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,166 INFO L290 TraceCheckUtils]: 120: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,166 INFO L290 TraceCheckUtils]: 121: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,167 INFO L290 TraceCheckUtils]: 122: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,167 INFO L290 TraceCheckUtils]: 123: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,167 INFO L290 TraceCheckUtils]: 124: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,167 INFO L290 TraceCheckUtils]: 125: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,167 INFO L290 TraceCheckUtils]: 126: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,168 INFO L290 TraceCheckUtils]: 127: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,168 INFO L290 TraceCheckUtils]: 128: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,168 INFO L290 TraceCheckUtils]: 129: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,168 INFO L290 TraceCheckUtils]: 130: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,169 INFO L290 TraceCheckUtils]: 131: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,169 INFO L290 TraceCheckUtils]: 132: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,169 INFO L290 TraceCheckUtils]: 133: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,169 INFO L290 TraceCheckUtils]: 134: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,169 INFO L290 TraceCheckUtils]: 135: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,170 INFO L290 TraceCheckUtils]: 136: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,170 INFO L290 TraceCheckUtils]: 137: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,170 INFO L290 TraceCheckUtils]: 138: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,170 INFO L290 TraceCheckUtils]: 139: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,170 INFO L290 TraceCheckUtils]: 140: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,171 INFO L290 TraceCheckUtils]: 141: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,171 INFO L290 TraceCheckUtils]: 142: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,171 INFO L290 TraceCheckUtils]: 143: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,171 INFO L290 TraceCheckUtils]: 144: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,171 INFO L290 TraceCheckUtils]: 145: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,172 INFO L290 TraceCheckUtils]: 146: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,172 INFO L290 TraceCheckUtils]: 147: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,172 INFO L290 TraceCheckUtils]: 148: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,172 INFO L290 TraceCheckUtils]: 149: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,173 INFO L290 TraceCheckUtils]: 150: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,173 INFO L290 TraceCheckUtils]: 151: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,173 INFO L290 TraceCheckUtils]: 152: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,173 INFO L290 TraceCheckUtils]: 153: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,173 INFO L290 TraceCheckUtils]: 154: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,174 INFO L290 TraceCheckUtils]: 155: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,174 INFO L290 TraceCheckUtils]: 156: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,174 INFO L290 TraceCheckUtils]: 157: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,174 INFO L290 TraceCheckUtils]: 158: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,174 INFO L290 TraceCheckUtils]: 159: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,175 INFO L290 TraceCheckUtils]: 160: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,175 INFO L290 TraceCheckUtils]: 161: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,175 INFO L290 TraceCheckUtils]: 162: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,175 INFO L290 TraceCheckUtils]: 163: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,175 INFO L290 TraceCheckUtils]: 164: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,176 INFO L290 TraceCheckUtils]: 165: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,176 INFO L290 TraceCheckUtils]: 166: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,176 INFO L290 TraceCheckUtils]: 167: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,176 INFO L290 TraceCheckUtils]: 168: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,177 INFO L290 TraceCheckUtils]: 169: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,177 INFO L290 TraceCheckUtils]: 170: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,177 INFO L290 TraceCheckUtils]: 171: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,177 INFO L290 TraceCheckUtils]: 172: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,177 INFO L290 TraceCheckUtils]: 173: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,178 INFO L290 TraceCheckUtils]: 174: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,178 INFO L290 TraceCheckUtils]: 175: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,178 INFO L290 TraceCheckUtils]: 176: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,178 INFO L290 TraceCheckUtils]: 177: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,179 INFO L290 TraceCheckUtils]: 178: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,179 INFO L290 TraceCheckUtils]: 179: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,179 INFO L290 TraceCheckUtils]: 180: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,179 INFO L290 TraceCheckUtils]: 181: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,179 INFO L290 TraceCheckUtils]: 182: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,180 INFO L290 TraceCheckUtils]: 183: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,180 INFO L290 TraceCheckUtils]: 184: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,180 INFO L290 TraceCheckUtils]: 185: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,180 INFO L290 TraceCheckUtils]: 186: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,180 INFO L290 TraceCheckUtils]: 187: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,181 INFO L290 TraceCheckUtils]: 188: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,181 INFO L290 TraceCheckUtils]: 189: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,181 INFO L290 TraceCheckUtils]: 190: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,181 INFO L290 TraceCheckUtils]: 191: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,181 INFO L290 TraceCheckUtils]: 192: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,182 INFO L290 TraceCheckUtils]: 193: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,182 INFO L290 TraceCheckUtils]: 194: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,182 INFO L290 TraceCheckUtils]: 195: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,182 INFO L290 TraceCheckUtils]: 196: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,183 INFO L290 TraceCheckUtils]: 197: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,183 INFO L290 TraceCheckUtils]: 198: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,183 INFO L290 TraceCheckUtils]: 199: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,183 INFO L290 TraceCheckUtils]: 200: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,183 INFO L290 TraceCheckUtils]: 201: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,184 INFO L290 TraceCheckUtils]: 202: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,184 INFO L290 TraceCheckUtils]: 203: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,184 INFO L290 TraceCheckUtils]: 204: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,184 INFO L290 TraceCheckUtils]: 205: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,184 INFO L290 TraceCheckUtils]: 206: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,185 INFO L290 TraceCheckUtils]: 207: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,185 INFO L290 TraceCheckUtils]: 208: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,185 INFO L290 TraceCheckUtils]: 209: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,185 INFO L290 TraceCheckUtils]: 210: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,185 INFO L290 TraceCheckUtils]: 211: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,186 INFO L290 TraceCheckUtils]: 212: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,186 INFO L290 TraceCheckUtils]: 213: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,186 INFO L290 TraceCheckUtils]: 214: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,186 INFO L290 TraceCheckUtils]: 215: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,187 INFO L290 TraceCheckUtils]: 216: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,187 INFO L290 TraceCheckUtils]: 217: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,187 INFO L290 TraceCheckUtils]: 218: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,187 INFO L290 TraceCheckUtils]: 219: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,187 INFO L290 TraceCheckUtils]: 220: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,188 INFO L290 TraceCheckUtils]: 221: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,188 INFO L290 TraceCheckUtils]: 222: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,188 INFO L290 TraceCheckUtils]: 223: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,188 INFO L290 TraceCheckUtils]: 224: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,188 INFO L290 TraceCheckUtils]: 225: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,189 INFO L290 TraceCheckUtils]: 226: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,189 INFO L290 TraceCheckUtils]: 227: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,189 INFO L290 TraceCheckUtils]: 228: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,189 INFO L290 TraceCheckUtils]: 229: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,189 INFO L290 TraceCheckUtils]: 230: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,190 INFO L290 TraceCheckUtils]: 231: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,190 INFO L290 TraceCheckUtils]: 232: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,190 INFO L290 TraceCheckUtils]: 233: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,190 INFO L290 TraceCheckUtils]: 234: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,190 INFO L290 TraceCheckUtils]: 235: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,191 INFO L290 TraceCheckUtils]: 236: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,191 INFO L290 TraceCheckUtils]: 237: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,191 INFO L290 TraceCheckUtils]: 238: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,191 INFO L290 TraceCheckUtils]: 239: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,192 INFO L290 TraceCheckUtils]: 240: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,192 INFO L290 TraceCheckUtils]: 241: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,192 INFO L290 TraceCheckUtils]: 242: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,192 INFO L290 TraceCheckUtils]: 243: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,192 INFO L290 TraceCheckUtils]: 244: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,193 INFO L290 TraceCheckUtils]: 245: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,193 INFO L290 TraceCheckUtils]: 246: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,193 INFO L290 TraceCheckUtils]: 247: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,193 INFO L290 TraceCheckUtils]: 248: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,193 INFO L290 TraceCheckUtils]: 249: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,194 INFO L290 TraceCheckUtils]: 250: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,194 INFO L290 TraceCheckUtils]: 251: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,194 INFO L290 TraceCheckUtils]: 252: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,194 INFO L290 TraceCheckUtils]: 253: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,194 INFO L290 TraceCheckUtils]: 254: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,195 INFO L290 TraceCheckUtils]: 255: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,195 INFO L290 TraceCheckUtils]: 256: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,195 INFO L290 TraceCheckUtils]: 257: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,195 INFO L290 TraceCheckUtils]: 258: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,196 INFO L290 TraceCheckUtils]: 259: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,196 INFO L290 TraceCheckUtils]: 260: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,196 INFO L290 TraceCheckUtils]: 261: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,196 INFO L290 TraceCheckUtils]: 262: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,196 INFO L290 TraceCheckUtils]: 263: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,197 INFO L290 TraceCheckUtils]: 264: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,197 INFO L290 TraceCheckUtils]: 265: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,197 INFO L290 TraceCheckUtils]: 266: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,197 INFO L290 TraceCheckUtils]: 267: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,197 INFO L290 TraceCheckUtils]: 268: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,198 INFO L290 TraceCheckUtils]: 269: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,198 INFO L290 TraceCheckUtils]: 270: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,198 INFO L290 TraceCheckUtils]: 271: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,198 INFO L290 TraceCheckUtils]: 272: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,198 INFO L290 TraceCheckUtils]: 273: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,199 INFO L290 TraceCheckUtils]: 274: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,199 INFO L290 TraceCheckUtils]: 275: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,199 INFO L290 TraceCheckUtils]: 276: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,199 INFO L290 TraceCheckUtils]: 277: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,199 INFO L290 TraceCheckUtils]: 278: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,200 INFO L290 TraceCheckUtils]: 279: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,200 INFO L290 TraceCheckUtils]: 280: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,200 INFO L290 TraceCheckUtils]: 281: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,200 INFO L290 TraceCheckUtils]: 282: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,201 INFO L290 TraceCheckUtils]: 283: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,201 INFO L290 TraceCheckUtils]: 284: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,201 INFO L290 TraceCheckUtils]: 285: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,201 INFO L290 TraceCheckUtils]: 286: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,201 INFO L290 TraceCheckUtils]: 287: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,202 INFO L290 TraceCheckUtils]: 288: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,215 INFO L290 TraceCheckUtils]: 289: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,215 INFO L290 TraceCheckUtils]: 290: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,215 INFO L290 TraceCheckUtils]: 291: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,215 INFO L290 TraceCheckUtils]: 292: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,216 INFO L290 TraceCheckUtils]: 293: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,216 INFO L290 TraceCheckUtils]: 294: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,216 INFO L290 TraceCheckUtils]: 295: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,216 INFO L290 TraceCheckUtils]: 296: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,217 INFO L290 TraceCheckUtils]: 297: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,217 INFO L290 TraceCheckUtils]: 298: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,217 INFO L290 TraceCheckUtils]: 299: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,217 INFO L290 TraceCheckUtils]: 300: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,217 INFO L290 TraceCheckUtils]: 301: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,218 INFO L290 TraceCheckUtils]: 302: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,218 INFO L290 TraceCheckUtils]: 303: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,218 INFO L290 TraceCheckUtils]: 304: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,218 INFO L290 TraceCheckUtils]: 305: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,218 INFO L290 TraceCheckUtils]: 306: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,219 INFO L290 TraceCheckUtils]: 307: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,219 INFO L290 TraceCheckUtils]: 308: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,219 INFO L290 TraceCheckUtils]: 309: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,219 INFO L290 TraceCheckUtils]: 310: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,219 INFO L290 TraceCheckUtils]: 311: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,220 INFO L290 TraceCheckUtils]: 312: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,220 INFO L290 TraceCheckUtils]: 313: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,220 INFO L290 TraceCheckUtils]: 314: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,220 INFO L290 TraceCheckUtils]: 315: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,221 INFO L290 TraceCheckUtils]: 316: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,221 INFO L290 TraceCheckUtils]: 317: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,221 INFO L290 TraceCheckUtils]: 318: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,221 INFO L290 TraceCheckUtils]: 319: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,221 INFO L290 TraceCheckUtils]: 320: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,222 INFO L290 TraceCheckUtils]: 321: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,222 INFO L290 TraceCheckUtils]: 322: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,222 INFO L290 TraceCheckUtils]: 323: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,222 INFO L290 TraceCheckUtils]: 324: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,222 INFO L290 TraceCheckUtils]: 325: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,223 INFO L290 TraceCheckUtils]: 326: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,223 INFO L290 TraceCheckUtils]: 327: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,223 INFO L290 TraceCheckUtils]: 328: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,223 INFO L290 TraceCheckUtils]: 329: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,223 INFO L290 TraceCheckUtils]: 330: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,224 INFO L290 TraceCheckUtils]: 331: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,224 INFO L290 TraceCheckUtils]: 332: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,224 INFO L290 TraceCheckUtils]: 333: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,224 INFO L290 TraceCheckUtils]: 334: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,224 INFO L290 TraceCheckUtils]: 335: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,225 INFO L290 TraceCheckUtils]: 336: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,225 INFO L290 TraceCheckUtils]: 337: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,225 INFO L290 TraceCheckUtils]: 338: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:12,225 INFO L290 TraceCheckUtils]: 339: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {35716#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:12,226 INFO L290 TraceCheckUtils]: 340: Hoare triple {35716#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {35716#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:12,226 INFO L290 TraceCheckUtils]: 341: Hoare triple {35716#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {35716#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:12,227 INFO L290 TraceCheckUtils]: 342: Hoare triple {35716#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {35717#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:36:12,227 INFO L290 TraceCheckUtils]: 343: Hoare triple {35717#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} assume !(~i~0 < ~edgecount~0); {35711#false} is VALID [2022-04-08 03:36:12,227 INFO L290 TraceCheckUtils]: 344: Hoare triple {35711#false} ~i~0 := 0; {35711#false} is VALID [2022-04-08 03:36:12,227 INFO L290 TraceCheckUtils]: 345: Hoare triple {35711#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35711#false} is VALID [2022-04-08 03:36:12,227 INFO L272 TraceCheckUtils]: 346: Hoare triple {35711#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {35711#false} is VALID [2022-04-08 03:36:12,227 INFO L290 TraceCheckUtils]: 347: Hoare triple {35711#false} ~cond := #in~cond; {35711#false} is VALID [2022-04-08 03:36:12,227 INFO L290 TraceCheckUtils]: 348: Hoare triple {35711#false} assume 0 == ~cond; {35711#false} is VALID [2022-04-08 03:36:12,227 INFO L290 TraceCheckUtils]: 349: Hoare triple {35711#false} assume !false; {35711#false} is VALID [2022-04-08 03:36:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 15421 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 03:36:12,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:36:12,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801527453] [2022-04-08 03:36:12,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801527453] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:36:12,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891489117] [2022-04-08 03:36:12,229 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:36:12,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:36:12,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:36:12,229 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:36:12,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-08 03:36:12,551 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 03:36:12,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:36:12,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 03:36:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:12,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:36:13,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {35710#true} call ULTIMATE.init(); {35710#true} is VALID [2022-04-08 03:36:13,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {35710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {35710#true} is VALID [2022-04-08 03:36:13,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {35710#true} assume true; {35710#true} is VALID [2022-04-08 03:36:13,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35710#true} {35710#true} #107#return; {35710#true} is VALID [2022-04-08 03:36:13,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {35710#true} call #t~ret22 := main(); {35710#true} is VALID [2022-04-08 03:36:13,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {35710#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {35737#(<= 20 main_~edgecount~0)} ~i~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,829 INFO L290 TraceCheckUtils]: 26: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,831 INFO L290 TraceCheckUtils]: 34: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,832 INFO L290 TraceCheckUtils]: 37: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,832 INFO L290 TraceCheckUtils]: 40: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,833 INFO L290 TraceCheckUtils]: 41: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,833 INFO L290 TraceCheckUtils]: 42: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,833 INFO L290 TraceCheckUtils]: 43: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,834 INFO L290 TraceCheckUtils]: 45: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,834 INFO L290 TraceCheckUtils]: 46: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,834 INFO L290 TraceCheckUtils]: 47: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,835 INFO L290 TraceCheckUtils]: 48: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,835 INFO L290 TraceCheckUtils]: 49: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,835 INFO L290 TraceCheckUtils]: 50: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,835 INFO L290 TraceCheckUtils]: 51: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,836 INFO L290 TraceCheckUtils]: 52: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,836 INFO L290 TraceCheckUtils]: 53: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,836 INFO L290 TraceCheckUtils]: 54: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,836 INFO L290 TraceCheckUtils]: 55: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,837 INFO L290 TraceCheckUtils]: 56: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,837 INFO L290 TraceCheckUtils]: 57: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,837 INFO L290 TraceCheckUtils]: 58: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,838 INFO L290 TraceCheckUtils]: 59: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,838 INFO L290 TraceCheckUtils]: 60: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,838 INFO L290 TraceCheckUtils]: 61: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,838 INFO L290 TraceCheckUtils]: 62: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,839 INFO L290 TraceCheckUtils]: 63: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,839 INFO L290 TraceCheckUtils]: 64: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,839 INFO L290 TraceCheckUtils]: 65: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,839 INFO L290 TraceCheckUtils]: 66: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,840 INFO L290 TraceCheckUtils]: 67: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,840 INFO L290 TraceCheckUtils]: 68: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,840 INFO L290 TraceCheckUtils]: 69: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,841 INFO L290 TraceCheckUtils]: 70: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,841 INFO L290 TraceCheckUtils]: 71: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,841 INFO L290 TraceCheckUtils]: 72: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,841 INFO L290 TraceCheckUtils]: 73: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,842 INFO L290 TraceCheckUtils]: 74: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,842 INFO L290 TraceCheckUtils]: 75: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,842 INFO L290 TraceCheckUtils]: 76: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,842 INFO L290 TraceCheckUtils]: 77: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,843 INFO L290 TraceCheckUtils]: 78: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,843 INFO L290 TraceCheckUtils]: 79: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,843 INFO L290 TraceCheckUtils]: 80: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,844 INFO L290 TraceCheckUtils]: 81: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,844 INFO L290 TraceCheckUtils]: 82: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,844 INFO L290 TraceCheckUtils]: 83: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,844 INFO L290 TraceCheckUtils]: 84: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,845 INFO L290 TraceCheckUtils]: 85: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,845 INFO L290 TraceCheckUtils]: 86: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,845 INFO L290 TraceCheckUtils]: 87: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,845 INFO L290 TraceCheckUtils]: 88: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,846 INFO L290 TraceCheckUtils]: 89: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,846 INFO L290 TraceCheckUtils]: 90: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,846 INFO L290 TraceCheckUtils]: 91: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,847 INFO L290 TraceCheckUtils]: 92: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,847 INFO L290 TraceCheckUtils]: 93: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,847 INFO L290 TraceCheckUtils]: 94: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,847 INFO L290 TraceCheckUtils]: 95: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,847 INFO L290 TraceCheckUtils]: 96: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,848 INFO L290 TraceCheckUtils]: 97: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,848 INFO L290 TraceCheckUtils]: 98: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,848 INFO L290 TraceCheckUtils]: 99: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,848 INFO L290 TraceCheckUtils]: 100: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,849 INFO L290 TraceCheckUtils]: 101: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,849 INFO L290 TraceCheckUtils]: 102: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,849 INFO L290 TraceCheckUtils]: 103: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,849 INFO L290 TraceCheckUtils]: 104: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,850 INFO L290 TraceCheckUtils]: 105: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,850 INFO L290 TraceCheckUtils]: 106: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,850 INFO L290 TraceCheckUtils]: 107: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,850 INFO L290 TraceCheckUtils]: 108: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,850 INFO L290 TraceCheckUtils]: 109: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,851 INFO L290 TraceCheckUtils]: 110: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,851 INFO L290 TraceCheckUtils]: 111: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,851 INFO L290 TraceCheckUtils]: 112: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,851 INFO L290 TraceCheckUtils]: 113: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,852 INFO L290 TraceCheckUtils]: 114: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,852 INFO L290 TraceCheckUtils]: 115: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,852 INFO L290 TraceCheckUtils]: 116: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,852 INFO L290 TraceCheckUtils]: 117: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,853 INFO L290 TraceCheckUtils]: 118: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,853 INFO L290 TraceCheckUtils]: 119: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,853 INFO L290 TraceCheckUtils]: 120: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,853 INFO L290 TraceCheckUtils]: 121: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,854 INFO L290 TraceCheckUtils]: 122: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,854 INFO L290 TraceCheckUtils]: 123: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,854 INFO L290 TraceCheckUtils]: 124: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,854 INFO L290 TraceCheckUtils]: 125: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,854 INFO L290 TraceCheckUtils]: 126: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,855 INFO L290 TraceCheckUtils]: 127: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,855 INFO L290 TraceCheckUtils]: 128: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,855 INFO L290 TraceCheckUtils]: 129: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,855 INFO L290 TraceCheckUtils]: 130: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,856 INFO L290 TraceCheckUtils]: 131: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,856 INFO L290 TraceCheckUtils]: 132: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,856 INFO L290 TraceCheckUtils]: 133: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,856 INFO L290 TraceCheckUtils]: 134: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,857 INFO L290 TraceCheckUtils]: 135: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,857 INFO L290 TraceCheckUtils]: 136: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,857 INFO L290 TraceCheckUtils]: 137: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,857 INFO L290 TraceCheckUtils]: 138: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,858 INFO L290 TraceCheckUtils]: 139: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,858 INFO L290 TraceCheckUtils]: 140: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,858 INFO L290 TraceCheckUtils]: 141: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,858 INFO L290 TraceCheckUtils]: 142: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,858 INFO L290 TraceCheckUtils]: 143: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,859 INFO L290 TraceCheckUtils]: 144: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,859 INFO L290 TraceCheckUtils]: 145: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,859 INFO L290 TraceCheckUtils]: 146: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,859 INFO L290 TraceCheckUtils]: 147: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,860 INFO L290 TraceCheckUtils]: 148: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,860 INFO L290 TraceCheckUtils]: 149: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,860 INFO L290 TraceCheckUtils]: 150: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,860 INFO L290 TraceCheckUtils]: 151: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,861 INFO L290 TraceCheckUtils]: 152: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,861 INFO L290 TraceCheckUtils]: 153: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,861 INFO L290 TraceCheckUtils]: 154: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,861 INFO L290 TraceCheckUtils]: 155: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,861 INFO L290 TraceCheckUtils]: 156: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,862 INFO L290 TraceCheckUtils]: 157: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,862 INFO L290 TraceCheckUtils]: 158: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,862 INFO L290 TraceCheckUtils]: 159: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,862 INFO L290 TraceCheckUtils]: 160: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,863 INFO L290 TraceCheckUtils]: 161: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,863 INFO L290 TraceCheckUtils]: 162: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,863 INFO L290 TraceCheckUtils]: 163: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,863 INFO L290 TraceCheckUtils]: 164: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,864 INFO L290 TraceCheckUtils]: 165: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,864 INFO L290 TraceCheckUtils]: 166: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,864 INFO L290 TraceCheckUtils]: 167: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,864 INFO L290 TraceCheckUtils]: 168: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,865 INFO L290 TraceCheckUtils]: 169: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,865 INFO L290 TraceCheckUtils]: 170: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,865 INFO L290 TraceCheckUtils]: 171: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,865 INFO L290 TraceCheckUtils]: 172: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,866 INFO L290 TraceCheckUtils]: 173: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,866 INFO L290 TraceCheckUtils]: 174: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,866 INFO L290 TraceCheckUtils]: 175: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,866 INFO L290 TraceCheckUtils]: 176: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,866 INFO L290 TraceCheckUtils]: 177: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,867 INFO L290 TraceCheckUtils]: 178: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,867 INFO L290 TraceCheckUtils]: 179: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,867 INFO L290 TraceCheckUtils]: 180: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,867 INFO L290 TraceCheckUtils]: 181: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,868 INFO L290 TraceCheckUtils]: 182: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,868 INFO L290 TraceCheckUtils]: 183: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,868 INFO L290 TraceCheckUtils]: 184: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,868 INFO L290 TraceCheckUtils]: 185: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,869 INFO L290 TraceCheckUtils]: 186: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,869 INFO L290 TraceCheckUtils]: 187: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,869 INFO L290 TraceCheckUtils]: 188: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,869 INFO L290 TraceCheckUtils]: 189: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,870 INFO L290 TraceCheckUtils]: 190: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,870 INFO L290 TraceCheckUtils]: 191: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,870 INFO L290 TraceCheckUtils]: 192: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,870 INFO L290 TraceCheckUtils]: 193: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,870 INFO L290 TraceCheckUtils]: 194: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,871 INFO L290 TraceCheckUtils]: 195: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,871 INFO L290 TraceCheckUtils]: 196: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,871 INFO L290 TraceCheckUtils]: 197: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,871 INFO L290 TraceCheckUtils]: 198: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,872 INFO L290 TraceCheckUtils]: 199: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,872 INFO L290 TraceCheckUtils]: 200: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,872 INFO L290 TraceCheckUtils]: 201: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,872 INFO L290 TraceCheckUtils]: 202: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,873 INFO L290 TraceCheckUtils]: 203: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,873 INFO L290 TraceCheckUtils]: 204: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,873 INFO L290 TraceCheckUtils]: 205: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,873 INFO L290 TraceCheckUtils]: 206: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,874 INFO L290 TraceCheckUtils]: 207: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,874 INFO L290 TraceCheckUtils]: 208: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,874 INFO L290 TraceCheckUtils]: 209: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,874 INFO L290 TraceCheckUtils]: 210: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,874 INFO L290 TraceCheckUtils]: 211: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,875 INFO L290 TraceCheckUtils]: 212: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,875 INFO L290 TraceCheckUtils]: 213: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,875 INFO L290 TraceCheckUtils]: 214: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,875 INFO L290 TraceCheckUtils]: 215: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,876 INFO L290 TraceCheckUtils]: 216: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,876 INFO L290 TraceCheckUtils]: 217: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,876 INFO L290 TraceCheckUtils]: 218: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,876 INFO L290 TraceCheckUtils]: 219: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,877 INFO L290 TraceCheckUtils]: 220: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,877 INFO L290 TraceCheckUtils]: 221: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,877 INFO L290 TraceCheckUtils]: 222: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,877 INFO L290 TraceCheckUtils]: 223: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,878 INFO L290 TraceCheckUtils]: 224: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,878 INFO L290 TraceCheckUtils]: 225: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,878 INFO L290 TraceCheckUtils]: 226: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,878 INFO L290 TraceCheckUtils]: 227: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,878 INFO L290 TraceCheckUtils]: 228: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,879 INFO L290 TraceCheckUtils]: 229: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,879 INFO L290 TraceCheckUtils]: 230: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,879 INFO L290 TraceCheckUtils]: 231: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,879 INFO L290 TraceCheckUtils]: 232: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,880 INFO L290 TraceCheckUtils]: 233: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,880 INFO L290 TraceCheckUtils]: 234: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,880 INFO L290 TraceCheckUtils]: 235: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,880 INFO L290 TraceCheckUtils]: 236: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,881 INFO L290 TraceCheckUtils]: 237: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,881 INFO L290 TraceCheckUtils]: 238: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,881 INFO L290 TraceCheckUtils]: 239: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,881 INFO L290 TraceCheckUtils]: 240: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,882 INFO L290 TraceCheckUtils]: 241: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,882 INFO L290 TraceCheckUtils]: 242: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,882 INFO L290 TraceCheckUtils]: 243: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,882 INFO L290 TraceCheckUtils]: 244: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,882 INFO L290 TraceCheckUtils]: 245: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,883 INFO L290 TraceCheckUtils]: 246: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,883 INFO L290 TraceCheckUtils]: 247: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,883 INFO L290 TraceCheckUtils]: 248: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,883 INFO L290 TraceCheckUtils]: 249: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,884 INFO L290 TraceCheckUtils]: 250: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,884 INFO L290 TraceCheckUtils]: 251: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,884 INFO L290 TraceCheckUtils]: 252: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,884 INFO L290 TraceCheckUtils]: 253: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,885 INFO L290 TraceCheckUtils]: 254: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,885 INFO L290 TraceCheckUtils]: 255: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,885 INFO L290 TraceCheckUtils]: 256: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,885 INFO L290 TraceCheckUtils]: 257: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,886 INFO L290 TraceCheckUtils]: 258: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,886 INFO L290 TraceCheckUtils]: 259: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,886 INFO L290 TraceCheckUtils]: 260: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,886 INFO L290 TraceCheckUtils]: 261: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,887 INFO L290 TraceCheckUtils]: 262: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,887 INFO L290 TraceCheckUtils]: 263: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,887 INFO L290 TraceCheckUtils]: 264: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,887 INFO L290 TraceCheckUtils]: 265: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,887 INFO L290 TraceCheckUtils]: 266: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,888 INFO L290 TraceCheckUtils]: 267: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,888 INFO L290 TraceCheckUtils]: 268: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,888 INFO L290 TraceCheckUtils]: 269: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,888 INFO L290 TraceCheckUtils]: 270: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,889 INFO L290 TraceCheckUtils]: 271: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,889 INFO L290 TraceCheckUtils]: 272: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,889 INFO L290 TraceCheckUtils]: 273: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,889 INFO L290 TraceCheckUtils]: 274: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,890 INFO L290 TraceCheckUtils]: 275: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,890 INFO L290 TraceCheckUtils]: 276: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,890 INFO L290 TraceCheckUtils]: 277: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,890 INFO L290 TraceCheckUtils]: 278: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,890 INFO L290 TraceCheckUtils]: 279: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,891 INFO L290 TraceCheckUtils]: 280: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,891 INFO L290 TraceCheckUtils]: 281: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,891 INFO L290 TraceCheckUtils]: 282: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,891 INFO L290 TraceCheckUtils]: 283: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,892 INFO L290 TraceCheckUtils]: 284: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,892 INFO L290 TraceCheckUtils]: 285: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,892 INFO L290 TraceCheckUtils]: 286: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,892 INFO L290 TraceCheckUtils]: 287: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,893 INFO L290 TraceCheckUtils]: 288: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,893 INFO L290 TraceCheckUtils]: 289: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,893 INFO L290 TraceCheckUtils]: 290: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,893 INFO L290 TraceCheckUtils]: 291: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,894 INFO L290 TraceCheckUtils]: 292: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,894 INFO L290 TraceCheckUtils]: 293: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,894 INFO L290 TraceCheckUtils]: 294: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,894 INFO L290 TraceCheckUtils]: 295: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,894 INFO L290 TraceCheckUtils]: 296: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,895 INFO L290 TraceCheckUtils]: 297: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,895 INFO L290 TraceCheckUtils]: 298: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,895 INFO L290 TraceCheckUtils]: 299: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,895 INFO L290 TraceCheckUtils]: 300: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,896 INFO L290 TraceCheckUtils]: 301: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,896 INFO L290 TraceCheckUtils]: 302: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,896 INFO L290 TraceCheckUtils]: 303: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,896 INFO L290 TraceCheckUtils]: 304: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,897 INFO L290 TraceCheckUtils]: 305: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,897 INFO L290 TraceCheckUtils]: 306: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,897 INFO L290 TraceCheckUtils]: 307: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,897 INFO L290 TraceCheckUtils]: 308: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,897 INFO L290 TraceCheckUtils]: 309: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,898 INFO L290 TraceCheckUtils]: 310: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,898 INFO L290 TraceCheckUtils]: 311: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,898 INFO L290 TraceCheckUtils]: 312: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,898 INFO L290 TraceCheckUtils]: 313: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,899 INFO L290 TraceCheckUtils]: 314: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,899 INFO L290 TraceCheckUtils]: 315: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,899 INFO L290 TraceCheckUtils]: 316: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,899 INFO L290 TraceCheckUtils]: 317: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,900 INFO L290 TraceCheckUtils]: 318: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,900 INFO L290 TraceCheckUtils]: 319: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,900 INFO L290 TraceCheckUtils]: 320: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,900 INFO L290 TraceCheckUtils]: 321: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,901 INFO L290 TraceCheckUtils]: 322: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,901 INFO L290 TraceCheckUtils]: 323: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,901 INFO L290 TraceCheckUtils]: 324: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,901 INFO L290 TraceCheckUtils]: 325: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,901 INFO L290 TraceCheckUtils]: 326: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,902 INFO L290 TraceCheckUtils]: 327: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,902 INFO L290 TraceCheckUtils]: 328: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,902 INFO L290 TraceCheckUtils]: 329: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,902 INFO L290 TraceCheckUtils]: 330: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,903 INFO L290 TraceCheckUtils]: 331: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,903 INFO L290 TraceCheckUtils]: 332: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,903 INFO L290 TraceCheckUtils]: 333: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,903 INFO L290 TraceCheckUtils]: 334: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,904 INFO L290 TraceCheckUtils]: 335: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,904 INFO L290 TraceCheckUtils]: 336: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,904 INFO L290 TraceCheckUtils]: 337: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,904 INFO L290 TraceCheckUtils]: 338: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:13,905 INFO L290 TraceCheckUtils]: 339: Hoare triple {35737#(<= 20 main_~edgecount~0)} ~i~0 := 0; {36740#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:13,905 INFO L290 TraceCheckUtils]: 340: Hoare triple {36740#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {36740#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:13,905 INFO L290 TraceCheckUtils]: 341: Hoare triple {36740#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {36740#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:13,906 INFO L290 TraceCheckUtils]: 342: Hoare triple {36740#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {36750#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:13,906 INFO L290 TraceCheckUtils]: 343: Hoare triple {36750#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {35711#false} is VALID [2022-04-08 03:36:13,906 INFO L290 TraceCheckUtils]: 344: Hoare triple {35711#false} ~i~0 := 0; {35711#false} is VALID [2022-04-08 03:36:13,906 INFO L290 TraceCheckUtils]: 345: Hoare triple {35711#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35711#false} is VALID [2022-04-08 03:36:13,906 INFO L272 TraceCheckUtils]: 346: Hoare triple {35711#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {35711#false} is VALID [2022-04-08 03:36:13,906 INFO L290 TraceCheckUtils]: 347: Hoare triple {35711#false} ~cond := #in~cond; {35711#false} is VALID [2022-04-08 03:36:13,906 INFO L290 TraceCheckUtils]: 348: Hoare triple {35711#false} assume 0 == ~cond; {35711#false} is VALID [2022-04-08 03:36:13,907 INFO L290 TraceCheckUtils]: 349: Hoare triple {35711#false} assume !false; {35711#false} is VALID [2022-04-08 03:36:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 15421 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 03:36:13,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:36:15,008 INFO L290 TraceCheckUtils]: 349: Hoare triple {35711#false} assume !false; {35711#false} is VALID [2022-04-08 03:36:15,008 INFO L290 TraceCheckUtils]: 348: Hoare triple {35711#false} assume 0 == ~cond; {35711#false} is VALID [2022-04-08 03:36:15,008 INFO L290 TraceCheckUtils]: 347: Hoare triple {35711#false} ~cond := #in~cond; {35711#false} is VALID [2022-04-08 03:36:15,008 INFO L272 TraceCheckUtils]: 346: Hoare triple {35711#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {35711#false} is VALID [2022-04-08 03:36:15,008 INFO L290 TraceCheckUtils]: 345: Hoare triple {35711#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35711#false} is VALID [2022-04-08 03:36:15,008 INFO L290 TraceCheckUtils]: 344: Hoare triple {35711#false} ~i~0 := 0; {35711#false} is VALID [2022-04-08 03:36:15,009 INFO L290 TraceCheckUtils]: 343: Hoare triple {36790#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {35711#false} is VALID [2022-04-08 03:36:15,009 INFO L290 TraceCheckUtils]: 342: Hoare triple {36794#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {36790#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,010 INFO L290 TraceCheckUtils]: 341: Hoare triple {36794#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {36794#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:15,010 INFO L290 TraceCheckUtils]: 340: Hoare triple {36794#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {36794#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:15,010 INFO L290 TraceCheckUtils]: 339: Hoare triple {36804#(< 1 main_~edgecount~0)} ~i~0 := 0; {36794#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:15,010 INFO L290 TraceCheckUtils]: 338: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,011 INFO L290 TraceCheckUtils]: 337: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,011 INFO L290 TraceCheckUtils]: 336: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,011 INFO L290 TraceCheckUtils]: 335: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,011 INFO L290 TraceCheckUtils]: 334: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,012 INFO L290 TraceCheckUtils]: 333: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,012 INFO L290 TraceCheckUtils]: 332: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,012 INFO L290 TraceCheckUtils]: 331: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,012 INFO L290 TraceCheckUtils]: 330: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,013 INFO L290 TraceCheckUtils]: 329: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,013 INFO L290 TraceCheckUtils]: 328: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,013 INFO L290 TraceCheckUtils]: 327: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,013 INFO L290 TraceCheckUtils]: 326: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,013 INFO L290 TraceCheckUtils]: 325: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,014 INFO L290 TraceCheckUtils]: 324: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,014 INFO L290 TraceCheckUtils]: 323: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,014 INFO L290 TraceCheckUtils]: 322: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,014 INFO L290 TraceCheckUtils]: 321: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,015 INFO L290 TraceCheckUtils]: 320: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,015 INFO L290 TraceCheckUtils]: 319: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,015 INFO L290 TraceCheckUtils]: 318: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,015 INFO L290 TraceCheckUtils]: 317: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,016 INFO L290 TraceCheckUtils]: 316: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,016 INFO L290 TraceCheckUtils]: 315: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,016 INFO L290 TraceCheckUtils]: 314: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,016 INFO L290 TraceCheckUtils]: 313: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,017 INFO L290 TraceCheckUtils]: 312: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,017 INFO L290 TraceCheckUtils]: 311: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,017 INFO L290 TraceCheckUtils]: 310: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,017 INFO L290 TraceCheckUtils]: 309: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,018 INFO L290 TraceCheckUtils]: 308: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,018 INFO L290 TraceCheckUtils]: 307: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,018 INFO L290 TraceCheckUtils]: 306: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,018 INFO L290 TraceCheckUtils]: 305: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,019 INFO L290 TraceCheckUtils]: 304: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,019 INFO L290 TraceCheckUtils]: 303: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,019 INFO L290 TraceCheckUtils]: 302: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,019 INFO L290 TraceCheckUtils]: 301: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,020 INFO L290 TraceCheckUtils]: 300: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,020 INFO L290 TraceCheckUtils]: 299: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,020 INFO L290 TraceCheckUtils]: 298: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,020 INFO L290 TraceCheckUtils]: 297: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,020 INFO L290 TraceCheckUtils]: 296: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,021 INFO L290 TraceCheckUtils]: 295: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,021 INFO L290 TraceCheckUtils]: 294: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,021 INFO L290 TraceCheckUtils]: 293: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,021 INFO L290 TraceCheckUtils]: 292: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,022 INFO L290 TraceCheckUtils]: 291: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,022 INFO L290 TraceCheckUtils]: 290: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,022 INFO L290 TraceCheckUtils]: 289: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,022 INFO L290 TraceCheckUtils]: 288: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,023 INFO L290 TraceCheckUtils]: 287: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,023 INFO L290 TraceCheckUtils]: 286: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,023 INFO L290 TraceCheckUtils]: 285: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,023 INFO L290 TraceCheckUtils]: 284: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,024 INFO L290 TraceCheckUtils]: 283: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,024 INFO L290 TraceCheckUtils]: 282: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,024 INFO L290 TraceCheckUtils]: 281: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,024 INFO L290 TraceCheckUtils]: 280: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,025 INFO L290 TraceCheckUtils]: 279: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,025 INFO L290 TraceCheckUtils]: 278: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,025 INFO L290 TraceCheckUtils]: 277: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,025 INFO L290 TraceCheckUtils]: 276: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,025 INFO L290 TraceCheckUtils]: 275: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,026 INFO L290 TraceCheckUtils]: 274: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,026 INFO L290 TraceCheckUtils]: 273: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,026 INFO L290 TraceCheckUtils]: 272: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,026 INFO L290 TraceCheckUtils]: 271: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,027 INFO L290 TraceCheckUtils]: 270: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,027 INFO L290 TraceCheckUtils]: 269: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,027 INFO L290 TraceCheckUtils]: 268: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,027 INFO L290 TraceCheckUtils]: 267: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,028 INFO L290 TraceCheckUtils]: 266: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,028 INFO L290 TraceCheckUtils]: 265: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,028 INFO L290 TraceCheckUtils]: 264: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,028 INFO L290 TraceCheckUtils]: 263: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,028 INFO L290 TraceCheckUtils]: 262: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,029 INFO L290 TraceCheckUtils]: 261: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,029 INFO L290 TraceCheckUtils]: 260: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,029 INFO L290 TraceCheckUtils]: 259: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,029 INFO L290 TraceCheckUtils]: 258: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,030 INFO L290 TraceCheckUtils]: 257: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,030 INFO L290 TraceCheckUtils]: 256: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,030 INFO L290 TraceCheckUtils]: 255: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,030 INFO L290 TraceCheckUtils]: 254: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,031 INFO L290 TraceCheckUtils]: 253: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,031 INFO L290 TraceCheckUtils]: 252: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,031 INFO L290 TraceCheckUtils]: 251: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,031 INFO L290 TraceCheckUtils]: 250: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,032 INFO L290 TraceCheckUtils]: 249: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,032 INFO L290 TraceCheckUtils]: 248: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,032 INFO L290 TraceCheckUtils]: 247: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,032 INFO L290 TraceCheckUtils]: 246: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,032 INFO L290 TraceCheckUtils]: 245: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,033 INFO L290 TraceCheckUtils]: 244: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,033 INFO L290 TraceCheckUtils]: 243: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,033 INFO L290 TraceCheckUtils]: 242: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,033 INFO L290 TraceCheckUtils]: 241: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,034 INFO L290 TraceCheckUtils]: 240: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,034 INFO L290 TraceCheckUtils]: 239: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,034 INFO L290 TraceCheckUtils]: 238: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,034 INFO L290 TraceCheckUtils]: 237: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,035 INFO L290 TraceCheckUtils]: 236: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,035 INFO L290 TraceCheckUtils]: 235: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,035 INFO L290 TraceCheckUtils]: 234: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,035 INFO L290 TraceCheckUtils]: 233: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,036 INFO L290 TraceCheckUtils]: 232: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,036 INFO L290 TraceCheckUtils]: 231: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,036 INFO L290 TraceCheckUtils]: 230: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,036 INFO L290 TraceCheckUtils]: 229: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,036 INFO L290 TraceCheckUtils]: 228: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,037 INFO L290 TraceCheckUtils]: 227: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,037 INFO L290 TraceCheckUtils]: 226: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,037 INFO L290 TraceCheckUtils]: 225: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,037 INFO L290 TraceCheckUtils]: 224: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,038 INFO L290 TraceCheckUtils]: 223: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,038 INFO L290 TraceCheckUtils]: 222: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,038 INFO L290 TraceCheckUtils]: 221: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,038 INFO L290 TraceCheckUtils]: 220: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,039 INFO L290 TraceCheckUtils]: 219: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,039 INFO L290 TraceCheckUtils]: 218: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,039 INFO L290 TraceCheckUtils]: 217: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,039 INFO L290 TraceCheckUtils]: 216: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,039 INFO L290 TraceCheckUtils]: 215: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,040 INFO L290 TraceCheckUtils]: 214: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,040 INFO L290 TraceCheckUtils]: 213: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,040 INFO L290 TraceCheckUtils]: 212: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,040 INFO L290 TraceCheckUtils]: 211: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,047 INFO L290 TraceCheckUtils]: 210: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,047 INFO L290 TraceCheckUtils]: 209: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,048 INFO L290 TraceCheckUtils]: 208: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,048 INFO L290 TraceCheckUtils]: 207: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,048 INFO L290 TraceCheckUtils]: 206: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,048 INFO L290 TraceCheckUtils]: 205: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,049 INFO L290 TraceCheckUtils]: 204: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,049 INFO L290 TraceCheckUtils]: 203: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,049 INFO L290 TraceCheckUtils]: 202: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,049 INFO L290 TraceCheckUtils]: 201: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,049 INFO L290 TraceCheckUtils]: 200: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,050 INFO L290 TraceCheckUtils]: 199: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,050 INFO L290 TraceCheckUtils]: 198: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,050 INFO L290 TraceCheckUtils]: 197: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,050 INFO L290 TraceCheckUtils]: 196: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,051 INFO L290 TraceCheckUtils]: 195: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,051 INFO L290 TraceCheckUtils]: 194: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,052 INFO L290 TraceCheckUtils]: 193: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,053 INFO L290 TraceCheckUtils]: 192: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,053 INFO L290 TraceCheckUtils]: 191: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,053 INFO L290 TraceCheckUtils]: 190: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,053 INFO L290 TraceCheckUtils]: 189: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,054 INFO L290 TraceCheckUtils]: 188: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,054 INFO L290 TraceCheckUtils]: 187: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,054 INFO L290 TraceCheckUtils]: 186: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,054 INFO L290 TraceCheckUtils]: 185: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,055 INFO L290 TraceCheckUtils]: 184: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,055 INFO L290 TraceCheckUtils]: 183: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,055 INFO L290 TraceCheckUtils]: 182: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,055 INFO L290 TraceCheckUtils]: 181: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,055 INFO L290 TraceCheckUtils]: 180: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,056 INFO L290 TraceCheckUtils]: 179: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,056 INFO L290 TraceCheckUtils]: 178: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,056 INFO L290 TraceCheckUtils]: 177: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,056 INFO L290 TraceCheckUtils]: 176: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,057 INFO L290 TraceCheckUtils]: 175: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,057 INFO L290 TraceCheckUtils]: 174: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,057 INFO L290 TraceCheckUtils]: 173: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,057 INFO L290 TraceCheckUtils]: 172: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,058 INFO L290 TraceCheckUtils]: 171: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,058 INFO L290 TraceCheckUtils]: 170: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,058 INFO L290 TraceCheckUtils]: 169: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,058 INFO L290 TraceCheckUtils]: 168: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,058 INFO L290 TraceCheckUtils]: 167: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,059 INFO L290 TraceCheckUtils]: 166: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,059 INFO L290 TraceCheckUtils]: 165: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,059 INFO L290 TraceCheckUtils]: 164: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,059 INFO L290 TraceCheckUtils]: 163: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,060 INFO L290 TraceCheckUtils]: 162: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,060 INFO L290 TraceCheckUtils]: 161: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,060 INFO L290 TraceCheckUtils]: 160: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,060 INFO L290 TraceCheckUtils]: 159: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,061 INFO L290 TraceCheckUtils]: 158: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,061 INFO L290 TraceCheckUtils]: 157: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,061 INFO L290 TraceCheckUtils]: 156: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,061 INFO L290 TraceCheckUtils]: 155: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,062 INFO L290 TraceCheckUtils]: 154: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,062 INFO L290 TraceCheckUtils]: 153: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,062 INFO L290 TraceCheckUtils]: 152: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,062 INFO L290 TraceCheckUtils]: 151: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,062 INFO L290 TraceCheckUtils]: 150: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,063 INFO L290 TraceCheckUtils]: 149: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,063 INFO L290 TraceCheckUtils]: 148: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,063 INFO L290 TraceCheckUtils]: 147: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,063 INFO L290 TraceCheckUtils]: 146: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,064 INFO L290 TraceCheckUtils]: 145: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,064 INFO L290 TraceCheckUtils]: 144: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,064 INFO L290 TraceCheckUtils]: 143: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,064 INFO L290 TraceCheckUtils]: 142: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,065 INFO L290 TraceCheckUtils]: 141: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,065 INFO L290 TraceCheckUtils]: 140: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,065 INFO L290 TraceCheckUtils]: 139: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,065 INFO L290 TraceCheckUtils]: 138: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,066 INFO L290 TraceCheckUtils]: 137: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,066 INFO L290 TraceCheckUtils]: 136: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,066 INFO L290 TraceCheckUtils]: 135: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,066 INFO L290 TraceCheckUtils]: 134: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,066 INFO L290 TraceCheckUtils]: 133: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,067 INFO L290 TraceCheckUtils]: 132: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,067 INFO L290 TraceCheckUtils]: 131: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,067 INFO L290 TraceCheckUtils]: 130: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,067 INFO L290 TraceCheckUtils]: 129: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,068 INFO L290 TraceCheckUtils]: 128: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,068 INFO L290 TraceCheckUtils]: 127: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,068 INFO L290 TraceCheckUtils]: 126: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,068 INFO L290 TraceCheckUtils]: 125: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,069 INFO L290 TraceCheckUtils]: 124: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,069 INFO L290 TraceCheckUtils]: 123: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,069 INFO L290 TraceCheckUtils]: 122: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,069 INFO L290 TraceCheckUtils]: 121: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,070 INFO L290 TraceCheckUtils]: 120: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,070 INFO L290 TraceCheckUtils]: 119: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,070 INFO L290 TraceCheckUtils]: 118: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,070 INFO L290 TraceCheckUtils]: 117: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,071 INFO L290 TraceCheckUtils]: 116: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,071 INFO L290 TraceCheckUtils]: 115: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,071 INFO L290 TraceCheckUtils]: 114: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,071 INFO L290 TraceCheckUtils]: 113: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,071 INFO L290 TraceCheckUtils]: 112: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,072 INFO L290 TraceCheckUtils]: 111: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,072 INFO L290 TraceCheckUtils]: 110: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,072 INFO L290 TraceCheckUtils]: 109: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,073 INFO L290 TraceCheckUtils]: 108: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,073 INFO L290 TraceCheckUtils]: 107: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,073 INFO L290 TraceCheckUtils]: 106: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,073 INFO L290 TraceCheckUtils]: 105: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,073 INFO L290 TraceCheckUtils]: 104: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,074 INFO L290 TraceCheckUtils]: 103: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,074 INFO L290 TraceCheckUtils]: 102: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,074 INFO L290 TraceCheckUtils]: 101: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,074 INFO L290 TraceCheckUtils]: 100: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,075 INFO L290 TraceCheckUtils]: 99: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,075 INFO L290 TraceCheckUtils]: 98: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,075 INFO L290 TraceCheckUtils]: 97: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,075 INFO L290 TraceCheckUtils]: 96: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,076 INFO L290 TraceCheckUtils]: 95: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,076 INFO L290 TraceCheckUtils]: 94: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,076 INFO L290 TraceCheckUtils]: 93: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,076 INFO L290 TraceCheckUtils]: 92: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,076 INFO L290 TraceCheckUtils]: 91: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,077 INFO L290 TraceCheckUtils]: 90: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,077 INFO L290 TraceCheckUtils]: 89: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,077 INFO L290 TraceCheckUtils]: 88: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,077 INFO L290 TraceCheckUtils]: 87: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,078 INFO L290 TraceCheckUtils]: 86: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,078 INFO L290 TraceCheckUtils]: 85: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,078 INFO L290 TraceCheckUtils]: 84: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,078 INFO L290 TraceCheckUtils]: 83: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,079 INFO L290 TraceCheckUtils]: 82: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,079 INFO L290 TraceCheckUtils]: 81: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,079 INFO L290 TraceCheckUtils]: 80: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,079 INFO L290 TraceCheckUtils]: 79: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,080 INFO L290 TraceCheckUtils]: 78: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,080 INFO L290 TraceCheckUtils]: 77: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,080 INFO L290 TraceCheckUtils]: 76: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,080 INFO L290 TraceCheckUtils]: 75: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,080 INFO L290 TraceCheckUtils]: 74: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,081 INFO L290 TraceCheckUtils]: 73: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,081 INFO L290 TraceCheckUtils]: 72: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,081 INFO L290 TraceCheckUtils]: 71: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,081 INFO L290 TraceCheckUtils]: 70: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,082 INFO L290 TraceCheckUtils]: 69: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,082 INFO L290 TraceCheckUtils]: 68: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,082 INFO L290 TraceCheckUtils]: 67: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,082 INFO L290 TraceCheckUtils]: 66: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,083 INFO L290 TraceCheckUtils]: 65: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,083 INFO L290 TraceCheckUtils]: 64: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,083 INFO L290 TraceCheckUtils]: 63: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,083 INFO L290 TraceCheckUtils]: 62: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,084 INFO L290 TraceCheckUtils]: 61: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,084 INFO L290 TraceCheckUtils]: 60: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,084 INFO L290 TraceCheckUtils]: 59: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,084 INFO L290 TraceCheckUtils]: 58: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,085 INFO L290 TraceCheckUtils]: 57: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,085 INFO L290 TraceCheckUtils]: 56: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,085 INFO L290 TraceCheckUtils]: 55: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,085 INFO L290 TraceCheckUtils]: 54: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,085 INFO L290 TraceCheckUtils]: 53: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,086 INFO L290 TraceCheckUtils]: 52: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,086 INFO L290 TraceCheckUtils]: 51: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,086 INFO L290 TraceCheckUtils]: 50: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,086 INFO L290 TraceCheckUtils]: 49: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,087 INFO L290 TraceCheckUtils]: 48: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,087 INFO L290 TraceCheckUtils]: 47: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,087 INFO L290 TraceCheckUtils]: 46: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,089 INFO L290 TraceCheckUtils]: 40: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,089 INFO L290 TraceCheckUtils]: 39: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,089 INFO L290 TraceCheckUtils]: 38: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,089 INFO L290 TraceCheckUtils]: 37: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,090 INFO L290 TraceCheckUtils]: 35: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,090 INFO L290 TraceCheckUtils]: 34: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,090 INFO L290 TraceCheckUtils]: 33: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {36804#(< 1 main_~edgecount~0)} ~i~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {36804#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {35710#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-08 03:36:15,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {35710#true} call #t~ret22 := main(); {35710#true} is VALID [2022-04-08 03:36:15,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35710#true} {35710#true} #107#return; {35710#true} is VALID [2022-04-08 03:36:15,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {35710#true} assume true; {35710#true} is VALID [2022-04-08 03:36:15,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {35710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {35710#true} is VALID [2022-04-08 03:36:15,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {35710#true} call ULTIMATE.init(); {35710#true} is VALID [2022-04-08 03:36:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 15421 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 03:36:15,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891489117] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:36:15,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:36:15,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-04-08 03:36:15,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:36:15,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1926348720] [2022-04-08 03:36:15,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1926348720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:36:15,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:36:15,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:36:15,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521981546] [2022-04-08 03:36:15,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:36:15,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 350 [2022-04-08 03:36:15,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:36:15,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:15,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:15,138 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:36:15,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:15,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:36:15,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-04-08 03:36:15,139 INFO L87 Difference]: Start difference. First operand 355 states and 464 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:16,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:16,705 INFO L93 Difference]: Finished difference Result 379 states and 491 transitions. [2022-04-08 03:36:16,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:36:16,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 350 [2022-04-08 03:36:16,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:36:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-04-08 03:36:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-04-08 03:36:16,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 84 transitions. [2022-04-08 03:36:16,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:16,784 INFO L225 Difference]: With dead ends: 379 [2022-04-08 03:36:16,784 INFO L226 Difference]: Without dead ends: 368 [2022-04-08 03:36:16,784 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 696 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2022-04-08 03:36:16,784 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 98 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:36:16,785 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 29 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:36:16,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-04-08 03:36:18,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 358. [2022-04-08 03:36:18,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:36:18,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 368 states. Second operand has 358 states, 352 states have (on average 1.3125) internal successors, (462), 352 states have internal predecessors, (462), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:18,321 INFO L74 IsIncluded]: Start isIncluded. First operand 368 states. Second operand has 358 states, 352 states have (on average 1.3125) internal successors, (462), 352 states have internal predecessors, (462), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:18,322 INFO L87 Difference]: Start difference. First operand 368 states. Second operand has 358 states, 352 states have (on average 1.3125) internal successors, (462), 352 states have internal predecessors, (462), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:18,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:18,328 INFO L93 Difference]: Finished difference Result 368 states and 479 transitions. [2022-04-08 03:36:18,328 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 479 transitions. [2022-04-08 03:36:18,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:18,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:18,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 358 states, 352 states have (on average 1.3125) internal successors, (462), 352 states have internal predecessors, (462), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 368 states. [2022-04-08 03:36:18,329 INFO L87 Difference]: Start difference. First operand has 358 states, 352 states have (on average 1.3125) internal successors, (462), 352 states have internal predecessors, (462), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 368 states. [2022-04-08 03:36:18,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:18,334 INFO L93 Difference]: Finished difference Result 368 states and 479 transitions. [2022-04-08 03:36:18,334 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 479 transitions. [2022-04-08 03:36:18,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:18,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:18,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:36:18,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:36:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 352 states have (on average 1.3125) internal successors, (462), 352 states have internal predecessors, (462), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:18,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 467 transitions. [2022-04-08 03:36:18,341 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 467 transitions. Word has length 350 [2022-04-08 03:36:18,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:36:18,341 INFO L478 AbstractCegarLoop]: Abstraction has 358 states and 467 transitions. [2022-04-08 03:36:18,341 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:18,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 358 states and 467 transitions. [2022-04-08 03:36:19,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 467 edges. 467 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:19,085 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 467 transitions. [2022-04-08 03:36:19,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2022-04-08 03:36:19,086 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:36:19,086 INFO L499 BasicCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:36:19,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-08 03:36:19,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:36:19,295 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:36:19,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:36:19,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1194423610, now seen corresponding path program 55 times [2022-04-08 03:36:19,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:19,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [421858904] [2022-04-08 03:36:19,299 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:36:19,299 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:36:19,299 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:36:19,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1194423610, now seen corresponding path program 56 times [2022-04-08 03:36:19,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:36:19,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864521511] [2022-04-08 03:36:19,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:36:19,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:36:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:19,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:36:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:19,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {40049#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {40040#true} is VALID [2022-04-08 03:36:19,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {40040#true} assume true; {40040#true} is VALID [2022-04-08 03:36:19,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40040#true} {40040#true} #107#return; {40040#true} is VALID [2022-04-08 03:36:19,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {40040#true} call ULTIMATE.init(); {40049#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:36:19,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {40049#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {40040#true} is VALID [2022-04-08 03:36:19,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {40040#true} assume true; {40040#true} is VALID [2022-04-08 03:36:19,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40040#true} {40040#true} #107#return; {40040#true} is VALID [2022-04-08 03:36:19,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {40040#true} call #t~ret22 := main(); {40040#true} is VALID [2022-04-08 03:36:19,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {40040#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {40045#(<= 20 main_~edgecount~0)} ~i~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,608 INFO L290 TraceCheckUtils]: 27: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,609 INFO L290 TraceCheckUtils]: 32: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,611 INFO L290 TraceCheckUtils]: 38: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,611 INFO L290 TraceCheckUtils]: 39: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,612 INFO L290 TraceCheckUtils]: 42: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,612 INFO L290 TraceCheckUtils]: 43: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,612 INFO L290 TraceCheckUtils]: 45: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,612 INFO L290 TraceCheckUtils]: 46: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,613 INFO L290 TraceCheckUtils]: 47: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,613 INFO L290 TraceCheckUtils]: 48: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,613 INFO L290 TraceCheckUtils]: 49: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,613 INFO L290 TraceCheckUtils]: 50: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,613 INFO L290 TraceCheckUtils]: 51: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,614 INFO L290 TraceCheckUtils]: 52: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,614 INFO L290 TraceCheckUtils]: 53: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,614 INFO L290 TraceCheckUtils]: 54: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,614 INFO L290 TraceCheckUtils]: 55: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,615 INFO L290 TraceCheckUtils]: 56: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,615 INFO L290 TraceCheckUtils]: 57: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,615 INFO L290 TraceCheckUtils]: 58: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,615 INFO L290 TraceCheckUtils]: 59: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,615 INFO L290 TraceCheckUtils]: 60: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,616 INFO L290 TraceCheckUtils]: 61: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,616 INFO L290 TraceCheckUtils]: 62: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,616 INFO L290 TraceCheckUtils]: 63: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,616 INFO L290 TraceCheckUtils]: 64: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,617 INFO L290 TraceCheckUtils]: 65: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,617 INFO L290 TraceCheckUtils]: 66: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,617 INFO L290 TraceCheckUtils]: 67: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,617 INFO L290 TraceCheckUtils]: 68: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,617 INFO L290 TraceCheckUtils]: 69: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,618 INFO L290 TraceCheckUtils]: 70: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,618 INFO L290 TraceCheckUtils]: 71: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,618 INFO L290 TraceCheckUtils]: 72: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,618 INFO L290 TraceCheckUtils]: 73: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,618 INFO L290 TraceCheckUtils]: 74: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,619 INFO L290 TraceCheckUtils]: 75: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,619 INFO L290 TraceCheckUtils]: 76: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,619 INFO L290 TraceCheckUtils]: 77: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,619 INFO L290 TraceCheckUtils]: 78: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,620 INFO L290 TraceCheckUtils]: 79: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,620 INFO L290 TraceCheckUtils]: 80: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,620 INFO L290 TraceCheckUtils]: 81: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,620 INFO L290 TraceCheckUtils]: 82: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,620 INFO L290 TraceCheckUtils]: 83: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,621 INFO L290 TraceCheckUtils]: 84: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,621 INFO L290 TraceCheckUtils]: 85: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,621 INFO L290 TraceCheckUtils]: 86: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,621 INFO L290 TraceCheckUtils]: 87: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,622 INFO L290 TraceCheckUtils]: 88: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,622 INFO L290 TraceCheckUtils]: 89: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,622 INFO L290 TraceCheckUtils]: 90: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,622 INFO L290 TraceCheckUtils]: 91: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,622 INFO L290 TraceCheckUtils]: 92: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,623 INFO L290 TraceCheckUtils]: 93: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,623 INFO L290 TraceCheckUtils]: 94: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,623 INFO L290 TraceCheckUtils]: 95: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,623 INFO L290 TraceCheckUtils]: 96: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,624 INFO L290 TraceCheckUtils]: 97: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,624 INFO L290 TraceCheckUtils]: 98: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,624 INFO L290 TraceCheckUtils]: 99: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,624 INFO L290 TraceCheckUtils]: 100: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,624 INFO L290 TraceCheckUtils]: 101: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,625 INFO L290 TraceCheckUtils]: 102: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,625 INFO L290 TraceCheckUtils]: 103: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,625 INFO L290 TraceCheckUtils]: 104: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,625 INFO L290 TraceCheckUtils]: 105: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,626 INFO L290 TraceCheckUtils]: 106: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,626 INFO L290 TraceCheckUtils]: 107: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,626 INFO L290 TraceCheckUtils]: 108: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,626 INFO L290 TraceCheckUtils]: 109: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,626 INFO L290 TraceCheckUtils]: 110: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,627 INFO L290 TraceCheckUtils]: 111: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,627 INFO L290 TraceCheckUtils]: 112: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,627 INFO L290 TraceCheckUtils]: 113: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,627 INFO L290 TraceCheckUtils]: 114: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,628 INFO L290 TraceCheckUtils]: 115: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,628 INFO L290 TraceCheckUtils]: 116: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,628 INFO L290 TraceCheckUtils]: 117: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,628 INFO L290 TraceCheckUtils]: 118: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,628 INFO L290 TraceCheckUtils]: 119: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,629 INFO L290 TraceCheckUtils]: 120: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,629 INFO L290 TraceCheckUtils]: 121: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,629 INFO L290 TraceCheckUtils]: 122: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,629 INFO L290 TraceCheckUtils]: 123: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,630 INFO L290 TraceCheckUtils]: 124: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,630 INFO L290 TraceCheckUtils]: 125: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,630 INFO L290 TraceCheckUtils]: 126: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,630 INFO L290 TraceCheckUtils]: 127: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,630 INFO L290 TraceCheckUtils]: 128: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,631 INFO L290 TraceCheckUtils]: 129: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,631 INFO L290 TraceCheckUtils]: 130: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,631 INFO L290 TraceCheckUtils]: 131: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,631 INFO L290 TraceCheckUtils]: 132: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,632 INFO L290 TraceCheckUtils]: 133: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,632 INFO L290 TraceCheckUtils]: 134: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,632 INFO L290 TraceCheckUtils]: 135: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,632 INFO L290 TraceCheckUtils]: 136: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,632 INFO L290 TraceCheckUtils]: 137: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,633 INFO L290 TraceCheckUtils]: 138: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,633 INFO L290 TraceCheckUtils]: 139: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,633 INFO L290 TraceCheckUtils]: 140: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,633 INFO L290 TraceCheckUtils]: 141: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,633 INFO L290 TraceCheckUtils]: 142: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,634 INFO L290 TraceCheckUtils]: 143: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,634 INFO L290 TraceCheckUtils]: 144: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,634 INFO L290 TraceCheckUtils]: 145: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,634 INFO L290 TraceCheckUtils]: 146: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,635 INFO L290 TraceCheckUtils]: 147: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,635 INFO L290 TraceCheckUtils]: 148: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,635 INFO L290 TraceCheckUtils]: 149: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,635 INFO L290 TraceCheckUtils]: 150: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,635 INFO L290 TraceCheckUtils]: 151: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,636 INFO L290 TraceCheckUtils]: 152: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,636 INFO L290 TraceCheckUtils]: 153: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,636 INFO L290 TraceCheckUtils]: 154: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,636 INFO L290 TraceCheckUtils]: 155: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,637 INFO L290 TraceCheckUtils]: 156: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,637 INFO L290 TraceCheckUtils]: 157: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,637 INFO L290 TraceCheckUtils]: 158: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,637 INFO L290 TraceCheckUtils]: 159: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,637 INFO L290 TraceCheckUtils]: 160: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,638 INFO L290 TraceCheckUtils]: 161: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,638 INFO L290 TraceCheckUtils]: 162: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,638 INFO L290 TraceCheckUtils]: 163: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,638 INFO L290 TraceCheckUtils]: 164: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,639 INFO L290 TraceCheckUtils]: 165: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,639 INFO L290 TraceCheckUtils]: 166: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,639 INFO L290 TraceCheckUtils]: 167: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,639 INFO L290 TraceCheckUtils]: 168: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,639 INFO L290 TraceCheckUtils]: 169: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,640 INFO L290 TraceCheckUtils]: 170: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,640 INFO L290 TraceCheckUtils]: 171: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,640 INFO L290 TraceCheckUtils]: 172: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,640 INFO L290 TraceCheckUtils]: 173: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,641 INFO L290 TraceCheckUtils]: 174: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,641 INFO L290 TraceCheckUtils]: 175: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,641 INFO L290 TraceCheckUtils]: 176: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,641 INFO L290 TraceCheckUtils]: 177: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,642 INFO L290 TraceCheckUtils]: 178: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,642 INFO L290 TraceCheckUtils]: 179: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,642 INFO L290 TraceCheckUtils]: 180: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,642 INFO L290 TraceCheckUtils]: 181: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,642 INFO L290 TraceCheckUtils]: 182: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,643 INFO L290 TraceCheckUtils]: 183: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,643 INFO L290 TraceCheckUtils]: 184: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,643 INFO L290 TraceCheckUtils]: 185: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,643 INFO L290 TraceCheckUtils]: 186: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,644 INFO L290 TraceCheckUtils]: 187: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,644 INFO L290 TraceCheckUtils]: 188: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,644 INFO L290 TraceCheckUtils]: 189: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,644 INFO L290 TraceCheckUtils]: 190: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,644 INFO L290 TraceCheckUtils]: 191: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,645 INFO L290 TraceCheckUtils]: 192: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,645 INFO L290 TraceCheckUtils]: 193: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,645 INFO L290 TraceCheckUtils]: 194: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,645 INFO L290 TraceCheckUtils]: 195: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,646 INFO L290 TraceCheckUtils]: 196: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,646 INFO L290 TraceCheckUtils]: 197: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,646 INFO L290 TraceCheckUtils]: 198: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,646 INFO L290 TraceCheckUtils]: 199: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,646 INFO L290 TraceCheckUtils]: 200: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,647 INFO L290 TraceCheckUtils]: 201: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,647 INFO L290 TraceCheckUtils]: 202: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,647 INFO L290 TraceCheckUtils]: 203: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,647 INFO L290 TraceCheckUtils]: 204: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,648 INFO L290 TraceCheckUtils]: 205: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,648 INFO L290 TraceCheckUtils]: 206: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,648 INFO L290 TraceCheckUtils]: 207: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,648 INFO L290 TraceCheckUtils]: 208: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,648 INFO L290 TraceCheckUtils]: 209: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,649 INFO L290 TraceCheckUtils]: 210: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,649 INFO L290 TraceCheckUtils]: 211: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,649 INFO L290 TraceCheckUtils]: 212: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,649 INFO L290 TraceCheckUtils]: 213: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,650 INFO L290 TraceCheckUtils]: 214: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,650 INFO L290 TraceCheckUtils]: 215: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,650 INFO L290 TraceCheckUtils]: 216: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,650 INFO L290 TraceCheckUtils]: 217: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,650 INFO L290 TraceCheckUtils]: 218: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,651 INFO L290 TraceCheckUtils]: 219: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,651 INFO L290 TraceCheckUtils]: 220: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,651 INFO L290 TraceCheckUtils]: 221: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,651 INFO L290 TraceCheckUtils]: 222: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,652 INFO L290 TraceCheckUtils]: 223: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,652 INFO L290 TraceCheckUtils]: 224: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,652 INFO L290 TraceCheckUtils]: 225: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,652 INFO L290 TraceCheckUtils]: 226: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,652 INFO L290 TraceCheckUtils]: 227: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,653 INFO L290 TraceCheckUtils]: 228: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,653 INFO L290 TraceCheckUtils]: 229: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,653 INFO L290 TraceCheckUtils]: 230: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,653 INFO L290 TraceCheckUtils]: 231: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,653 INFO L290 TraceCheckUtils]: 232: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,654 INFO L290 TraceCheckUtils]: 233: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,654 INFO L290 TraceCheckUtils]: 234: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,654 INFO L290 TraceCheckUtils]: 235: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,654 INFO L290 TraceCheckUtils]: 236: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,655 INFO L290 TraceCheckUtils]: 237: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,655 INFO L290 TraceCheckUtils]: 238: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,655 INFO L290 TraceCheckUtils]: 239: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,655 INFO L290 TraceCheckUtils]: 240: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,655 INFO L290 TraceCheckUtils]: 241: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,656 INFO L290 TraceCheckUtils]: 242: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,656 INFO L290 TraceCheckUtils]: 243: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,656 INFO L290 TraceCheckUtils]: 244: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,656 INFO L290 TraceCheckUtils]: 245: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,657 INFO L290 TraceCheckUtils]: 246: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,657 INFO L290 TraceCheckUtils]: 247: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,657 INFO L290 TraceCheckUtils]: 248: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,657 INFO L290 TraceCheckUtils]: 249: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,658 INFO L290 TraceCheckUtils]: 250: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,658 INFO L290 TraceCheckUtils]: 251: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,658 INFO L290 TraceCheckUtils]: 252: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,658 INFO L290 TraceCheckUtils]: 253: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,658 INFO L290 TraceCheckUtils]: 254: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,659 INFO L290 TraceCheckUtils]: 255: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,659 INFO L290 TraceCheckUtils]: 256: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,659 INFO L290 TraceCheckUtils]: 257: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,659 INFO L290 TraceCheckUtils]: 258: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,659 INFO L290 TraceCheckUtils]: 259: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,660 INFO L290 TraceCheckUtils]: 260: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,660 INFO L290 TraceCheckUtils]: 261: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,660 INFO L290 TraceCheckUtils]: 262: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,660 INFO L290 TraceCheckUtils]: 263: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,661 INFO L290 TraceCheckUtils]: 264: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,661 INFO L290 TraceCheckUtils]: 265: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,661 INFO L290 TraceCheckUtils]: 266: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,661 INFO L290 TraceCheckUtils]: 267: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,661 INFO L290 TraceCheckUtils]: 268: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,662 INFO L290 TraceCheckUtils]: 269: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,662 INFO L290 TraceCheckUtils]: 270: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,662 INFO L290 TraceCheckUtils]: 271: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,662 INFO L290 TraceCheckUtils]: 272: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,663 INFO L290 TraceCheckUtils]: 273: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,663 INFO L290 TraceCheckUtils]: 274: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,663 INFO L290 TraceCheckUtils]: 275: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,663 INFO L290 TraceCheckUtils]: 276: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,663 INFO L290 TraceCheckUtils]: 277: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,664 INFO L290 TraceCheckUtils]: 278: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,664 INFO L290 TraceCheckUtils]: 279: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,664 INFO L290 TraceCheckUtils]: 280: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,664 INFO L290 TraceCheckUtils]: 281: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,665 INFO L290 TraceCheckUtils]: 282: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,665 INFO L290 TraceCheckUtils]: 283: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,665 INFO L290 TraceCheckUtils]: 284: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,665 INFO L290 TraceCheckUtils]: 285: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,665 INFO L290 TraceCheckUtils]: 286: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,666 INFO L290 TraceCheckUtils]: 287: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,666 INFO L290 TraceCheckUtils]: 288: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,666 INFO L290 TraceCheckUtils]: 289: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,666 INFO L290 TraceCheckUtils]: 290: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,666 INFO L290 TraceCheckUtils]: 291: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,667 INFO L290 TraceCheckUtils]: 292: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,667 INFO L290 TraceCheckUtils]: 293: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,667 INFO L290 TraceCheckUtils]: 294: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,667 INFO L290 TraceCheckUtils]: 295: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,668 INFO L290 TraceCheckUtils]: 296: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,668 INFO L290 TraceCheckUtils]: 297: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,668 INFO L290 TraceCheckUtils]: 298: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,668 INFO L290 TraceCheckUtils]: 299: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,668 INFO L290 TraceCheckUtils]: 300: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,669 INFO L290 TraceCheckUtils]: 301: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,669 INFO L290 TraceCheckUtils]: 302: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,669 INFO L290 TraceCheckUtils]: 303: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,669 INFO L290 TraceCheckUtils]: 304: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,669 INFO L290 TraceCheckUtils]: 305: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,670 INFO L290 TraceCheckUtils]: 306: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,670 INFO L290 TraceCheckUtils]: 307: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,670 INFO L290 TraceCheckUtils]: 308: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,670 INFO L290 TraceCheckUtils]: 309: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,670 INFO L290 TraceCheckUtils]: 310: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,671 INFO L290 TraceCheckUtils]: 311: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,671 INFO L290 TraceCheckUtils]: 312: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,671 INFO L290 TraceCheckUtils]: 313: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,671 INFO L290 TraceCheckUtils]: 314: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,672 INFO L290 TraceCheckUtils]: 315: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,672 INFO L290 TraceCheckUtils]: 316: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,672 INFO L290 TraceCheckUtils]: 317: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,672 INFO L290 TraceCheckUtils]: 318: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,672 INFO L290 TraceCheckUtils]: 319: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,673 INFO L290 TraceCheckUtils]: 320: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,673 INFO L290 TraceCheckUtils]: 321: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,673 INFO L290 TraceCheckUtils]: 322: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,673 INFO L290 TraceCheckUtils]: 323: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,673 INFO L290 TraceCheckUtils]: 324: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,674 INFO L290 TraceCheckUtils]: 325: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,674 INFO L290 TraceCheckUtils]: 326: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,674 INFO L290 TraceCheckUtils]: 327: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,674 INFO L290 TraceCheckUtils]: 328: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,674 INFO L290 TraceCheckUtils]: 329: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,675 INFO L290 TraceCheckUtils]: 330: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,675 INFO L290 TraceCheckUtils]: 331: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,675 INFO L290 TraceCheckUtils]: 332: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,675 INFO L290 TraceCheckUtils]: 333: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,675 INFO L290 TraceCheckUtils]: 334: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,676 INFO L290 TraceCheckUtils]: 335: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,676 INFO L290 TraceCheckUtils]: 336: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,676 INFO L290 TraceCheckUtils]: 337: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,676 INFO L290 TraceCheckUtils]: 338: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:19,677 INFO L290 TraceCheckUtils]: 339: Hoare triple {40045#(<= 20 main_~edgecount~0)} ~i~0 := 0; {40046#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:19,677 INFO L290 TraceCheckUtils]: 340: Hoare triple {40046#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {40046#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:19,677 INFO L290 TraceCheckUtils]: 341: Hoare triple {40046#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {40046#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:19,678 INFO L290 TraceCheckUtils]: 342: Hoare triple {40046#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {40047#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 03:36:19,678 INFO L290 TraceCheckUtils]: 343: Hoare triple {40047#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {40047#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 03:36:19,678 INFO L290 TraceCheckUtils]: 344: Hoare triple {40047#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {40047#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 03:36:19,679 INFO L290 TraceCheckUtils]: 345: Hoare triple {40047#(<= (+ 19 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {40048#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:36:19,679 INFO L290 TraceCheckUtils]: 346: Hoare triple {40048#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {40041#false} is VALID [2022-04-08 03:36:19,679 INFO L290 TraceCheckUtils]: 347: Hoare triple {40041#false} ~i~0 := 0; {40041#false} is VALID [2022-04-08 03:36:19,679 INFO L290 TraceCheckUtils]: 348: Hoare triple {40041#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40041#false} is VALID [2022-04-08 03:36:19,679 INFO L272 TraceCheckUtils]: 349: Hoare triple {40041#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {40041#false} is VALID [2022-04-08 03:36:19,679 INFO L290 TraceCheckUtils]: 350: Hoare triple {40041#false} ~cond := #in~cond; {40041#false} is VALID [2022-04-08 03:36:19,679 INFO L290 TraceCheckUtils]: 351: Hoare triple {40041#false} assume 0 == ~cond; {40041#false} is VALID [2022-04-08 03:36:19,679 INFO L290 TraceCheckUtils]: 352: Hoare triple {40041#false} assume !false; {40041#false} is VALID [2022-04-08 03:36:19,680 INFO L134 CoverageAnalysis]: Checked inductivity of 15425 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 03:36:19,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:36:19,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864521511] [2022-04-08 03:36:19,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864521511] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:36:19,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747599894] [2022-04-08 03:36:19,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:36:19,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:36:19,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:36:19,683 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:36:19,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-08 03:36:20,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:36:20,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:36:20,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 2151 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 03:36:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:20,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:36:21,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {40040#true} call ULTIMATE.init(); {40040#true} is VALID [2022-04-08 03:36:21,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {40040#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {40040#true} is VALID [2022-04-08 03:36:21,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {40040#true} assume true; {40040#true} is VALID [2022-04-08 03:36:21,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40040#true} {40040#true} #107#return; {40040#true} is VALID [2022-04-08 03:36:21,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {40040#true} call #t~ret22 := main(); {40040#true} is VALID [2022-04-08 03:36:21,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {40040#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {40045#(<= 20 main_~edgecount~0)} ~i~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,411 INFO L290 TraceCheckUtils]: 34: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,411 INFO L290 TraceCheckUtils]: 35: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,412 INFO L290 TraceCheckUtils]: 39: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,412 INFO L290 TraceCheckUtils]: 40: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,413 INFO L290 TraceCheckUtils]: 41: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,413 INFO L290 TraceCheckUtils]: 42: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,413 INFO L290 TraceCheckUtils]: 43: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,413 INFO L290 TraceCheckUtils]: 44: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,414 INFO L290 TraceCheckUtils]: 46: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,414 INFO L290 TraceCheckUtils]: 47: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,414 INFO L290 TraceCheckUtils]: 48: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,414 INFO L290 TraceCheckUtils]: 49: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,415 INFO L290 TraceCheckUtils]: 50: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,415 INFO L290 TraceCheckUtils]: 51: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,415 INFO L290 TraceCheckUtils]: 52: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,415 INFO L290 TraceCheckUtils]: 53: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,416 INFO L290 TraceCheckUtils]: 54: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,416 INFO L290 TraceCheckUtils]: 55: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,416 INFO L290 TraceCheckUtils]: 56: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,416 INFO L290 TraceCheckUtils]: 57: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,417 INFO L290 TraceCheckUtils]: 58: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,417 INFO L290 TraceCheckUtils]: 59: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,417 INFO L290 TraceCheckUtils]: 60: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,417 INFO L290 TraceCheckUtils]: 61: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,418 INFO L290 TraceCheckUtils]: 62: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,418 INFO L290 TraceCheckUtils]: 63: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,418 INFO L290 TraceCheckUtils]: 64: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,418 INFO L290 TraceCheckUtils]: 65: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,419 INFO L290 TraceCheckUtils]: 66: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,419 INFO L290 TraceCheckUtils]: 67: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,419 INFO L290 TraceCheckUtils]: 68: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,419 INFO L290 TraceCheckUtils]: 69: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,419 INFO L290 TraceCheckUtils]: 70: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,420 INFO L290 TraceCheckUtils]: 71: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,420 INFO L290 TraceCheckUtils]: 72: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,420 INFO L290 TraceCheckUtils]: 73: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,420 INFO L290 TraceCheckUtils]: 74: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,421 INFO L290 TraceCheckUtils]: 75: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,421 INFO L290 TraceCheckUtils]: 76: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,421 INFO L290 TraceCheckUtils]: 77: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,421 INFO L290 TraceCheckUtils]: 78: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,422 INFO L290 TraceCheckUtils]: 79: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,422 INFO L290 TraceCheckUtils]: 80: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,422 INFO L290 TraceCheckUtils]: 81: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,422 INFO L290 TraceCheckUtils]: 82: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,423 INFO L290 TraceCheckUtils]: 83: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,423 INFO L290 TraceCheckUtils]: 84: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,423 INFO L290 TraceCheckUtils]: 85: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,423 INFO L290 TraceCheckUtils]: 86: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,424 INFO L290 TraceCheckUtils]: 87: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,424 INFO L290 TraceCheckUtils]: 88: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,424 INFO L290 TraceCheckUtils]: 89: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,424 INFO L290 TraceCheckUtils]: 90: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,425 INFO L290 TraceCheckUtils]: 91: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,425 INFO L290 TraceCheckUtils]: 92: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,425 INFO L290 TraceCheckUtils]: 93: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,425 INFO L290 TraceCheckUtils]: 94: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,426 INFO L290 TraceCheckUtils]: 95: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,426 INFO L290 TraceCheckUtils]: 96: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,426 INFO L290 TraceCheckUtils]: 97: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,426 INFO L290 TraceCheckUtils]: 98: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,427 INFO L290 TraceCheckUtils]: 99: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,427 INFO L290 TraceCheckUtils]: 100: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,427 INFO L290 TraceCheckUtils]: 101: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,428 INFO L290 TraceCheckUtils]: 102: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,428 INFO L290 TraceCheckUtils]: 103: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,428 INFO L290 TraceCheckUtils]: 104: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,428 INFO L290 TraceCheckUtils]: 105: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,429 INFO L290 TraceCheckUtils]: 106: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,429 INFO L290 TraceCheckUtils]: 107: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,429 INFO L290 TraceCheckUtils]: 108: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,429 INFO L290 TraceCheckUtils]: 109: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,430 INFO L290 TraceCheckUtils]: 110: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,430 INFO L290 TraceCheckUtils]: 111: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,430 INFO L290 TraceCheckUtils]: 112: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,430 INFO L290 TraceCheckUtils]: 113: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,431 INFO L290 TraceCheckUtils]: 114: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,431 INFO L290 TraceCheckUtils]: 115: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,431 INFO L290 TraceCheckUtils]: 116: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,432 INFO L290 TraceCheckUtils]: 117: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,432 INFO L290 TraceCheckUtils]: 118: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,432 INFO L290 TraceCheckUtils]: 119: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,432 INFO L290 TraceCheckUtils]: 120: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,433 INFO L290 TraceCheckUtils]: 121: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,433 INFO L290 TraceCheckUtils]: 122: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,433 INFO L290 TraceCheckUtils]: 123: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,433 INFO L290 TraceCheckUtils]: 124: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,434 INFO L290 TraceCheckUtils]: 125: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,434 INFO L290 TraceCheckUtils]: 126: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,434 INFO L290 TraceCheckUtils]: 127: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,434 INFO L290 TraceCheckUtils]: 128: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,435 INFO L290 TraceCheckUtils]: 129: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,435 INFO L290 TraceCheckUtils]: 130: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,435 INFO L290 TraceCheckUtils]: 131: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,436 INFO L290 TraceCheckUtils]: 132: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,436 INFO L290 TraceCheckUtils]: 133: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,436 INFO L290 TraceCheckUtils]: 134: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,436 INFO L290 TraceCheckUtils]: 135: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,437 INFO L290 TraceCheckUtils]: 136: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,437 INFO L290 TraceCheckUtils]: 137: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,437 INFO L290 TraceCheckUtils]: 138: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,437 INFO L290 TraceCheckUtils]: 139: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,438 INFO L290 TraceCheckUtils]: 140: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,438 INFO L290 TraceCheckUtils]: 141: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,438 INFO L290 TraceCheckUtils]: 142: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,438 INFO L290 TraceCheckUtils]: 143: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,439 INFO L290 TraceCheckUtils]: 144: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,439 INFO L290 TraceCheckUtils]: 145: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,439 INFO L290 TraceCheckUtils]: 146: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,439 INFO L290 TraceCheckUtils]: 147: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,440 INFO L290 TraceCheckUtils]: 148: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,440 INFO L290 TraceCheckUtils]: 149: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,440 INFO L290 TraceCheckUtils]: 150: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,441 INFO L290 TraceCheckUtils]: 151: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,441 INFO L290 TraceCheckUtils]: 152: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,441 INFO L290 TraceCheckUtils]: 153: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,441 INFO L290 TraceCheckUtils]: 154: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,442 INFO L290 TraceCheckUtils]: 155: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,442 INFO L290 TraceCheckUtils]: 156: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,442 INFO L290 TraceCheckUtils]: 157: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,442 INFO L290 TraceCheckUtils]: 158: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,443 INFO L290 TraceCheckUtils]: 159: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,443 INFO L290 TraceCheckUtils]: 160: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,443 INFO L290 TraceCheckUtils]: 161: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,443 INFO L290 TraceCheckUtils]: 162: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,444 INFO L290 TraceCheckUtils]: 163: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,444 INFO L290 TraceCheckUtils]: 164: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,444 INFO L290 TraceCheckUtils]: 165: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,445 INFO L290 TraceCheckUtils]: 166: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,445 INFO L290 TraceCheckUtils]: 167: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,447 INFO L290 TraceCheckUtils]: 168: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,451 INFO L290 TraceCheckUtils]: 169: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,459 INFO L290 TraceCheckUtils]: 170: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,459 INFO L290 TraceCheckUtils]: 171: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,459 INFO L290 TraceCheckUtils]: 172: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,460 INFO L290 TraceCheckUtils]: 173: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,460 INFO L290 TraceCheckUtils]: 174: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,460 INFO L290 TraceCheckUtils]: 175: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,461 INFO L290 TraceCheckUtils]: 176: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,461 INFO L290 TraceCheckUtils]: 177: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,461 INFO L290 TraceCheckUtils]: 178: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,461 INFO L290 TraceCheckUtils]: 179: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,462 INFO L290 TraceCheckUtils]: 180: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,462 INFO L290 TraceCheckUtils]: 181: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,462 INFO L290 TraceCheckUtils]: 182: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,462 INFO L290 TraceCheckUtils]: 183: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,463 INFO L290 TraceCheckUtils]: 184: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,463 INFO L290 TraceCheckUtils]: 185: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,463 INFO L290 TraceCheckUtils]: 186: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,464 INFO L290 TraceCheckUtils]: 187: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,464 INFO L290 TraceCheckUtils]: 188: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,464 INFO L290 TraceCheckUtils]: 189: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,464 INFO L290 TraceCheckUtils]: 190: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,465 INFO L290 TraceCheckUtils]: 191: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,465 INFO L290 TraceCheckUtils]: 192: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,465 INFO L290 TraceCheckUtils]: 193: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,465 INFO L290 TraceCheckUtils]: 194: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,466 INFO L290 TraceCheckUtils]: 195: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,466 INFO L290 TraceCheckUtils]: 196: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,466 INFO L290 TraceCheckUtils]: 197: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,467 INFO L290 TraceCheckUtils]: 198: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,467 INFO L290 TraceCheckUtils]: 199: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,467 INFO L290 TraceCheckUtils]: 200: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,467 INFO L290 TraceCheckUtils]: 201: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,468 INFO L290 TraceCheckUtils]: 202: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,468 INFO L290 TraceCheckUtils]: 203: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,468 INFO L290 TraceCheckUtils]: 204: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,468 INFO L290 TraceCheckUtils]: 205: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,469 INFO L290 TraceCheckUtils]: 206: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,469 INFO L290 TraceCheckUtils]: 207: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,469 INFO L290 TraceCheckUtils]: 208: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,469 INFO L290 TraceCheckUtils]: 209: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,470 INFO L290 TraceCheckUtils]: 210: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,470 INFO L290 TraceCheckUtils]: 211: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,470 INFO L290 TraceCheckUtils]: 212: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,470 INFO L290 TraceCheckUtils]: 213: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,471 INFO L290 TraceCheckUtils]: 214: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,471 INFO L290 TraceCheckUtils]: 215: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,471 INFO L290 TraceCheckUtils]: 216: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,472 INFO L290 TraceCheckUtils]: 217: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,472 INFO L290 TraceCheckUtils]: 218: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,472 INFO L290 TraceCheckUtils]: 219: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,472 INFO L290 TraceCheckUtils]: 220: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,473 INFO L290 TraceCheckUtils]: 221: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,473 INFO L290 TraceCheckUtils]: 222: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,473 INFO L290 TraceCheckUtils]: 223: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,473 INFO L290 TraceCheckUtils]: 224: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,474 INFO L290 TraceCheckUtils]: 225: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,474 INFO L290 TraceCheckUtils]: 226: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,474 INFO L290 TraceCheckUtils]: 227: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,474 INFO L290 TraceCheckUtils]: 228: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,475 INFO L290 TraceCheckUtils]: 229: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,475 INFO L290 TraceCheckUtils]: 230: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,475 INFO L290 TraceCheckUtils]: 231: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,475 INFO L290 TraceCheckUtils]: 232: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,476 INFO L290 TraceCheckUtils]: 233: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,476 INFO L290 TraceCheckUtils]: 234: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,476 INFO L290 TraceCheckUtils]: 235: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,477 INFO L290 TraceCheckUtils]: 236: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,477 INFO L290 TraceCheckUtils]: 237: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,477 INFO L290 TraceCheckUtils]: 238: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,477 INFO L290 TraceCheckUtils]: 239: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,478 INFO L290 TraceCheckUtils]: 240: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,478 INFO L290 TraceCheckUtils]: 241: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,478 INFO L290 TraceCheckUtils]: 242: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,478 INFO L290 TraceCheckUtils]: 243: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,479 INFO L290 TraceCheckUtils]: 244: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,479 INFO L290 TraceCheckUtils]: 245: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,479 INFO L290 TraceCheckUtils]: 246: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,479 INFO L290 TraceCheckUtils]: 247: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,480 INFO L290 TraceCheckUtils]: 248: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,480 INFO L290 TraceCheckUtils]: 249: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,480 INFO L290 TraceCheckUtils]: 250: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,481 INFO L290 TraceCheckUtils]: 251: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,481 INFO L290 TraceCheckUtils]: 252: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,481 INFO L290 TraceCheckUtils]: 253: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,481 INFO L290 TraceCheckUtils]: 254: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,482 INFO L290 TraceCheckUtils]: 255: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,482 INFO L290 TraceCheckUtils]: 256: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,482 INFO L290 TraceCheckUtils]: 257: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,482 INFO L290 TraceCheckUtils]: 258: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,483 INFO L290 TraceCheckUtils]: 259: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,483 INFO L290 TraceCheckUtils]: 260: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,483 INFO L290 TraceCheckUtils]: 261: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,483 INFO L290 TraceCheckUtils]: 262: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,484 INFO L290 TraceCheckUtils]: 263: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,484 INFO L290 TraceCheckUtils]: 264: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,484 INFO L290 TraceCheckUtils]: 265: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,484 INFO L290 TraceCheckUtils]: 266: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,485 INFO L290 TraceCheckUtils]: 267: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,485 INFO L290 TraceCheckUtils]: 268: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,485 INFO L290 TraceCheckUtils]: 269: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,486 INFO L290 TraceCheckUtils]: 270: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,486 INFO L290 TraceCheckUtils]: 271: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,486 INFO L290 TraceCheckUtils]: 272: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,486 INFO L290 TraceCheckUtils]: 273: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,487 INFO L290 TraceCheckUtils]: 274: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,487 INFO L290 TraceCheckUtils]: 275: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,487 INFO L290 TraceCheckUtils]: 276: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,487 INFO L290 TraceCheckUtils]: 277: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,488 INFO L290 TraceCheckUtils]: 278: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,488 INFO L290 TraceCheckUtils]: 279: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,488 INFO L290 TraceCheckUtils]: 280: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,488 INFO L290 TraceCheckUtils]: 281: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,489 INFO L290 TraceCheckUtils]: 282: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,489 INFO L290 TraceCheckUtils]: 283: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,489 INFO L290 TraceCheckUtils]: 284: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,489 INFO L290 TraceCheckUtils]: 285: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,490 INFO L290 TraceCheckUtils]: 286: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,490 INFO L290 TraceCheckUtils]: 287: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,490 INFO L290 TraceCheckUtils]: 288: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,490 INFO L290 TraceCheckUtils]: 289: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,491 INFO L290 TraceCheckUtils]: 290: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,491 INFO L290 TraceCheckUtils]: 291: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,491 INFO L290 TraceCheckUtils]: 292: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,492 INFO L290 TraceCheckUtils]: 293: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,492 INFO L290 TraceCheckUtils]: 294: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,492 INFO L290 TraceCheckUtils]: 295: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,492 INFO L290 TraceCheckUtils]: 296: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,493 INFO L290 TraceCheckUtils]: 297: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,493 INFO L290 TraceCheckUtils]: 298: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,493 INFO L290 TraceCheckUtils]: 299: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,493 INFO L290 TraceCheckUtils]: 300: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,494 INFO L290 TraceCheckUtils]: 301: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,494 INFO L290 TraceCheckUtils]: 302: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,494 INFO L290 TraceCheckUtils]: 303: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,494 INFO L290 TraceCheckUtils]: 304: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,495 INFO L290 TraceCheckUtils]: 305: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,495 INFO L290 TraceCheckUtils]: 306: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,495 INFO L290 TraceCheckUtils]: 307: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,496 INFO L290 TraceCheckUtils]: 308: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,496 INFO L290 TraceCheckUtils]: 309: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,496 INFO L290 TraceCheckUtils]: 310: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,496 INFO L290 TraceCheckUtils]: 311: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,497 INFO L290 TraceCheckUtils]: 312: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,497 INFO L290 TraceCheckUtils]: 313: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,497 INFO L290 TraceCheckUtils]: 314: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,498 INFO L290 TraceCheckUtils]: 315: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,498 INFO L290 TraceCheckUtils]: 316: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,498 INFO L290 TraceCheckUtils]: 317: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,498 INFO L290 TraceCheckUtils]: 318: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,499 INFO L290 TraceCheckUtils]: 319: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,499 INFO L290 TraceCheckUtils]: 320: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,499 INFO L290 TraceCheckUtils]: 321: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,499 INFO L290 TraceCheckUtils]: 322: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,500 INFO L290 TraceCheckUtils]: 323: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,500 INFO L290 TraceCheckUtils]: 324: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,500 INFO L290 TraceCheckUtils]: 325: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,500 INFO L290 TraceCheckUtils]: 326: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,501 INFO L290 TraceCheckUtils]: 327: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,501 INFO L290 TraceCheckUtils]: 328: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,501 INFO L290 TraceCheckUtils]: 329: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,501 INFO L290 TraceCheckUtils]: 330: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,502 INFO L290 TraceCheckUtils]: 331: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,502 INFO L290 TraceCheckUtils]: 332: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,502 INFO L290 TraceCheckUtils]: 333: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,502 INFO L290 TraceCheckUtils]: 334: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,502 INFO L290 TraceCheckUtils]: 335: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,503 INFO L290 TraceCheckUtils]: 336: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,503 INFO L290 TraceCheckUtils]: 337: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,503 INFO L290 TraceCheckUtils]: 338: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:21,504 INFO L290 TraceCheckUtils]: 339: Hoare triple {40045#(<= 20 main_~edgecount~0)} ~i~0 := 0; {41070#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:21,504 INFO L290 TraceCheckUtils]: 340: Hoare triple {41070#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {41070#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:21,504 INFO L290 TraceCheckUtils]: 341: Hoare triple {41070#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {41070#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:21,505 INFO L290 TraceCheckUtils]: 342: Hoare triple {41070#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {41080#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:21,505 INFO L290 TraceCheckUtils]: 343: Hoare triple {41080#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {41080#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:21,506 INFO L290 TraceCheckUtils]: 344: Hoare triple {41080#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {41080#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:21,506 INFO L290 TraceCheckUtils]: 345: Hoare triple {41080#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {41090#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:21,506 INFO L290 TraceCheckUtils]: 346: Hoare triple {41090#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !(~i~0 < ~edgecount~0); {40041#false} is VALID [2022-04-08 03:36:21,507 INFO L290 TraceCheckUtils]: 347: Hoare triple {40041#false} ~i~0 := 0; {40041#false} is VALID [2022-04-08 03:36:21,507 INFO L290 TraceCheckUtils]: 348: Hoare triple {40041#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40041#false} is VALID [2022-04-08 03:36:21,507 INFO L272 TraceCheckUtils]: 349: Hoare triple {40041#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {40041#false} is VALID [2022-04-08 03:36:21,507 INFO L290 TraceCheckUtils]: 350: Hoare triple {40041#false} ~cond := #in~cond; {40041#false} is VALID [2022-04-08 03:36:21,507 INFO L290 TraceCheckUtils]: 351: Hoare triple {40041#false} assume 0 == ~cond; {40041#false} is VALID [2022-04-08 03:36:21,507 INFO L290 TraceCheckUtils]: 352: Hoare triple {40041#false} assume !false; {40041#false} is VALID [2022-04-08 03:36:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 15425 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 03:36:21,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:36:22,580 INFO L290 TraceCheckUtils]: 352: Hoare triple {40041#false} assume !false; {40041#false} is VALID [2022-04-08 03:36:22,581 INFO L290 TraceCheckUtils]: 351: Hoare triple {40041#false} assume 0 == ~cond; {40041#false} is VALID [2022-04-08 03:36:22,581 INFO L290 TraceCheckUtils]: 350: Hoare triple {40041#false} ~cond := #in~cond; {40041#false} is VALID [2022-04-08 03:36:22,581 INFO L272 TraceCheckUtils]: 349: Hoare triple {40041#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {40041#false} is VALID [2022-04-08 03:36:22,581 INFO L290 TraceCheckUtils]: 348: Hoare triple {40041#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40041#false} is VALID [2022-04-08 03:36:22,581 INFO L290 TraceCheckUtils]: 347: Hoare triple {40041#false} ~i~0 := 0; {40041#false} is VALID [2022-04-08 03:36:22,581 INFO L290 TraceCheckUtils]: 346: Hoare triple {41130#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {40041#false} is VALID [2022-04-08 03:36:22,582 INFO L290 TraceCheckUtils]: 345: Hoare triple {41134#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {41130#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,582 INFO L290 TraceCheckUtils]: 344: Hoare triple {41134#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {41134#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:22,582 INFO L290 TraceCheckUtils]: 343: Hoare triple {41134#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {41134#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:22,583 INFO L290 TraceCheckUtils]: 342: Hoare triple {41144#(< (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {41134#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:22,583 INFO L290 TraceCheckUtils]: 341: Hoare triple {41144#(< (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {41144#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:36:22,583 INFO L290 TraceCheckUtils]: 340: Hoare triple {41144#(< (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {41144#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:36:22,583 INFO L290 TraceCheckUtils]: 339: Hoare triple {41154#(< 2 main_~edgecount~0)} ~i~0 := 0; {41144#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:36:22,584 INFO L290 TraceCheckUtils]: 338: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,584 INFO L290 TraceCheckUtils]: 337: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,584 INFO L290 TraceCheckUtils]: 336: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,584 INFO L290 TraceCheckUtils]: 335: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,585 INFO L290 TraceCheckUtils]: 334: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,585 INFO L290 TraceCheckUtils]: 333: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,585 INFO L290 TraceCheckUtils]: 332: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,585 INFO L290 TraceCheckUtils]: 331: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,586 INFO L290 TraceCheckUtils]: 330: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,586 INFO L290 TraceCheckUtils]: 329: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,586 INFO L290 TraceCheckUtils]: 328: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,587 INFO L290 TraceCheckUtils]: 327: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,587 INFO L290 TraceCheckUtils]: 326: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,587 INFO L290 TraceCheckUtils]: 325: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,587 INFO L290 TraceCheckUtils]: 324: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,588 INFO L290 TraceCheckUtils]: 323: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,588 INFO L290 TraceCheckUtils]: 322: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,588 INFO L290 TraceCheckUtils]: 321: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,588 INFO L290 TraceCheckUtils]: 320: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,589 INFO L290 TraceCheckUtils]: 319: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,589 INFO L290 TraceCheckUtils]: 318: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,589 INFO L290 TraceCheckUtils]: 317: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,590 INFO L290 TraceCheckUtils]: 316: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,590 INFO L290 TraceCheckUtils]: 315: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,590 INFO L290 TraceCheckUtils]: 314: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,590 INFO L290 TraceCheckUtils]: 313: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,591 INFO L290 TraceCheckUtils]: 312: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,591 INFO L290 TraceCheckUtils]: 311: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,591 INFO L290 TraceCheckUtils]: 310: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,591 INFO L290 TraceCheckUtils]: 309: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,592 INFO L290 TraceCheckUtils]: 308: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,592 INFO L290 TraceCheckUtils]: 307: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,592 INFO L290 TraceCheckUtils]: 306: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,592 INFO L290 TraceCheckUtils]: 305: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,593 INFO L290 TraceCheckUtils]: 304: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,593 INFO L290 TraceCheckUtils]: 303: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,593 INFO L290 TraceCheckUtils]: 302: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,594 INFO L290 TraceCheckUtils]: 301: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,594 INFO L290 TraceCheckUtils]: 300: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,594 INFO L290 TraceCheckUtils]: 299: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,594 INFO L290 TraceCheckUtils]: 298: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,595 INFO L290 TraceCheckUtils]: 297: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,595 INFO L290 TraceCheckUtils]: 296: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,595 INFO L290 TraceCheckUtils]: 295: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,595 INFO L290 TraceCheckUtils]: 294: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,596 INFO L290 TraceCheckUtils]: 293: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,596 INFO L290 TraceCheckUtils]: 292: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,596 INFO L290 TraceCheckUtils]: 291: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,596 INFO L290 TraceCheckUtils]: 290: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,597 INFO L290 TraceCheckUtils]: 289: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,597 INFO L290 TraceCheckUtils]: 288: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,597 INFO L290 TraceCheckUtils]: 287: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,597 INFO L290 TraceCheckUtils]: 286: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,598 INFO L290 TraceCheckUtils]: 285: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,598 INFO L290 TraceCheckUtils]: 284: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,598 INFO L290 TraceCheckUtils]: 283: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,598 INFO L290 TraceCheckUtils]: 282: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,599 INFO L290 TraceCheckUtils]: 281: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,599 INFO L290 TraceCheckUtils]: 280: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,599 INFO L290 TraceCheckUtils]: 279: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,599 INFO L290 TraceCheckUtils]: 278: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,600 INFO L290 TraceCheckUtils]: 277: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,600 INFO L290 TraceCheckUtils]: 276: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,600 INFO L290 TraceCheckUtils]: 275: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,601 INFO L290 TraceCheckUtils]: 274: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,601 INFO L290 TraceCheckUtils]: 273: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,601 INFO L290 TraceCheckUtils]: 272: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,601 INFO L290 TraceCheckUtils]: 271: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,602 INFO L290 TraceCheckUtils]: 270: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,602 INFO L290 TraceCheckUtils]: 269: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,602 INFO L290 TraceCheckUtils]: 268: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,602 INFO L290 TraceCheckUtils]: 267: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,603 INFO L290 TraceCheckUtils]: 266: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,603 INFO L290 TraceCheckUtils]: 265: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,603 INFO L290 TraceCheckUtils]: 264: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,603 INFO L290 TraceCheckUtils]: 263: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,604 INFO L290 TraceCheckUtils]: 262: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,604 INFO L290 TraceCheckUtils]: 261: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,604 INFO L290 TraceCheckUtils]: 260: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,604 INFO L290 TraceCheckUtils]: 259: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,605 INFO L290 TraceCheckUtils]: 258: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,605 INFO L290 TraceCheckUtils]: 257: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,605 INFO L290 TraceCheckUtils]: 256: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,605 INFO L290 TraceCheckUtils]: 255: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,606 INFO L290 TraceCheckUtils]: 254: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,606 INFO L290 TraceCheckUtils]: 253: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,606 INFO L290 TraceCheckUtils]: 252: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,606 INFO L290 TraceCheckUtils]: 251: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,607 INFO L290 TraceCheckUtils]: 250: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,607 INFO L290 TraceCheckUtils]: 249: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,607 INFO L290 TraceCheckUtils]: 248: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,608 INFO L290 TraceCheckUtils]: 247: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,608 INFO L290 TraceCheckUtils]: 246: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,608 INFO L290 TraceCheckUtils]: 245: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,608 INFO L290 TraceCheckUtils]: 244: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,609 INFO L290 TraceCheckUtils]: 243: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,609 INFO L290 TraceCheckUtils]: 242: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,609 INFO L290 TraceCheckUtils]: 241: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,609 INFO L290 TraceCheckUtils]: 240: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,610 INFO L290 TraceCheckUtils]: 239: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,610 INFO L290 TraceCheckUtils]: 238: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,610 INFO L290 TraceCheckUtils]: 237: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,610 INFO L290 TraceCheckUtils]: 236: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,611 INFO L290 TraceCheckUtils]: 235: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,611 INFO L290 TraceCheckUtils]: 234: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,611 INFO L290 TraceCheckUtils]: 233: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,611 INFO L290 TraceCheckUtils]: 232: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,612 INFO L290 TraceCheckUtils]: 231: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,612 INFO L290 TraceCheckUtils]: 230: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,612 INFO L290 TraceCheckUtils]: 229: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,612 INFO L290 TraceCheckUtils]: 228: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,613 INFO L290 TraceCheckUtils]: 227: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,613 INFO L290 TraceCheckUtils]: 226: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,613 INFO L290 TraceCheckUtils]: 225: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,613 INFO L290 TraceCheckUtils]: 224: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,614 INFO L290 TraceCheckUtils]: 223: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,614 INFO L290 TraceCheckUtils]: 222: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,614 INFO L290 TraceCheckUtils]: 221: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,615 INFO L290 TraceCheckUtils]: 220: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,615 INFO L290 TraceCheckUtils]: 219: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,615 INFO L290 TraceCheckUtils]: 218: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,615 INFO L290 TraceCheckUtils]: 217: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,616 INFO L290 TraceCheckUtils]: 216: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,616 INFO L290 TraceCheckUtils]: 215: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,616 INFO L290 TraceCheckUtils]: 214: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,616 INFO L290 TraceCheckUtils]: 213: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,617 INFO L290 TraceCheckUtils]: 212: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,617 INFO L290 TraceCheckUtils]: 211: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,617 INFO L290 TraceCheckUtils]: 210: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,617 INFO L290 TraceCheckUtils]: 209: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,618 INFO L290 TraceCheckUtils]: 208: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,618 INFO L290 TraceCheckUtils]: 207: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,618 INFO L290 TraceCheckUtils]: 206: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,618 INFO L290 TraceCheckUtils]: 205: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,619 INFO L290 TraceCheckUtils]: 204: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,619 INFO L290 TraceCheckUtils]: 203: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,619 INFO L290 TraceCheckUtils]: 202: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,619 INFO L290 TraceCheckUtils]: 201: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,620 INFO L290 TraceCheckUtils]: 200: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,620 INFO L290 TraceCheckUtils]: 199: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,620 INFO L290 TraceCheckUtils]: 198: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,621 INFO L290 TraceCheckUtils]: 197: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,621 INFO L290 TraceCheckUtils]: 196: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,621 INFO L290 TraceCheckUtils]: 195: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,621 INFO L290 TraceCheckUtils]: 194: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,622 INFO L290 TraceCheckUtils]: 193: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,622 INFO L290 TraceCheckUtils]: 192: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,622 INFO L290 TraceCheckUtils]: 191: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,622 INFO L290 TraceCheckUtils]: 190: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,623 INFO L290 TraceCheckUtils]: 189: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,623 INFO L290 TraceCheckUtils]: 188: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,623 INFO L290 TraceCheckUtils]: 187: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,623 INFO L290 TraceCheckUtils]: 186: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,624 INFO L290 TraceCheckUtils]: 185: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,624 INFO L290 TraceCheckUtils]: 184: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,624 INFO L290 TraceCheckUtils]: 183: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,624 INFO L290 TraceCheckUtils]: 182: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,625 INFO L290 TraceCheckUtils]: 181: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,625 INFO L290 TraceCheckUtils]: 180: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,625 INFO L290 TraceCheckUtils]: 179: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,626 INFO L290 TraceCheckUtils]: 178: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,626 INFO L290 TraceCheckUtils]: 177: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,626 INFO L290 TraceCheckUtils]: 176: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,626 INFO L290 TraceCheckUtils]: 175: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,627 INFO L290 TraceCheckUtils]: 174: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,627 INFO L290 TraceCheckUtils]: 173: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,627 INFO L290 TraceCheckUtils]: 172: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,627 INFO L290 TraceCheckUtils]: 171: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,628 INFO L290 TraceCheckUtils]: 170: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,628 INFO L290 TraceCheckUtils]: 169: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,628 INFO L290 TraceCheckUtils]: 168: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,628 INFO L290 TraceCheckUtils]: 167: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,629 INFO L290 TraceCheckUtils]: 166: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,629 INFO L290 TraceCheckUtils]: 165: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,629 INFO L290 TraceCheckUtils]: 164: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,629 INFO L290 TraceCheckUtils]: 163: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,630 INFO L290 TraceCheckUtils]: 162: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,630 INFO L290 TraceCheckUtils]: 161: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,630 INFO L290 TraceCheckUtils]: 160: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,630 INFO L290 TraceCheckUtils]: 159: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,631 INFO L290 TraceCheckUtils]: 158: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,631 INFO L290 TraceCheckUtils]: 157: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,631 INFO L290 TraceCheckUtils]: 156: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,631 INFO L290 TraceCheckUtils]: 155: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,632 INFO L290 TraceCheckUtils]: 154: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,632 INFO L290 TraceCheckUtils]: 153: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,632 INFO L290 TraceCheckUtils]: 152: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,633 INFO L290 TraceCheckUtils]: 151: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,633 INFO L290 TraceCheckUtils]: 150: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,633 INFO L290 TraceCheckUtils]: 149: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,633 INFO L290 TraceCheckUtils]: 148: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,634 INFO L290 TraceCheckUtils]: 147: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,634 INFO L290 TraceCheckUtils]: 146: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,634 INFO L290 TraceCheckUtils]: 145: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,634 INFO L290 TraceCheckUtils]: 144: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,635 INFO L290 TraceCheckUtils]: 143: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,635 INFO L290 TraceCheckUtils]: 142: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,635 INFO L290 TraceCheckUtils]: 141: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,635 INFO L290 TraceCheckUtils]: 140: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,636 INFO L290 TraceCheckUtils]: 139: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,636 INFO L290 TraceCheckUtils]: 138: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,636 INFO L290 TraceCheckUtils]: 137: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,636 INFO L290 TraceCheckUtils]: 136: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,637 INFO L290 TraceCheckUtils]: 135: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,637 INFO L290 TraceCheckUtils]: 134: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,637 INFO L290 TraceCheckUtils]: 133: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,637 INFO L290 TraceCheckUtils]: 132: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,638 INFO L290 TraceCheckUtils]: 131: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,638 INFO L290 TraceCheckUtils]: 130: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,638 INFO L290 TraceCheckUtils]: 129: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,639 INFO L290 TraceCheckUtils]: 128: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,639 INFO L290 TraceCheckUtils]: 127: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,639 INFO L290 TraceCheckUtils]: 126: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,639 INFO L290 TraceCheckUtils]: 125: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,640 INFO L290 TraceCheckUtils]: 124: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,640 INFO L290 TraceCheckUtils]: 123: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,640 INFO L290 TraceCheckUtils]: 122: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,640 INFO L290 TraceCheckUtils]: 121: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,641 INFO L290 TraceCheckUtils]: 120: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,641 INFO L290 TraceCheckUtils]: 119: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,641 INFO L290 TraceCheckUtils]: 118: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,641 INFO L290 TraceCheckUtils]: 117: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,642 INFO L290 TraceCheckUtils]: 116: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,642 INFO L290 TraceCheckUtils]: 115: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,642 INFO L290 TraceCheckUtils]: 114: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,642 INFO L290 TraceCheckUtils]: 113: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,643 INFO L290 TraceCheckUtils]: 112: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,643 INFO L290 TraceCheckUtils]: 111: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,643 INFO L290 TraceCheckUtils]: 110: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,644 INFO L290 TraceCheckUtils]: 109: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,644 INFO L290 TraceCheckUtils]: 108: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,644 INFO L290 TraceCheckUtils]: 107: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,644 INFO L290 TraceCheckUtils]: 106: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,645 INFO L290 TraceCheckUtils]: 105: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,645 INFO L290 TraceCheckUtils]: 104: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,645 INFO L290 TraceCheckUtils]: 103: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,645 INFO L290 TraceCheckUtils]: 102: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,646 INFO L290 TraceCheckUtils]: 101: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,646 INFO L290 TraceCheckUtils]: 100: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,646 INFO L290 TraceCheckUtils]: 99: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,646 INFO L290 TraceCheckUtils]: 98: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,647 INFO L290 TraceCheckUtils]: 97: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,647 INFO L290 TraceCheckUtils]: 96: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,647 INFO L290 TraceCheckUtils]: 95: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,648 INFO L290 TraceCheckUtils]: 94: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,648 INFO L290 TraceCheckUtils]: 93: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,648 INFO L290 TraceCheckUtils]: 92: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,648 INFO L290 TraceCheckUtils]: 91: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,649 INFO L290 TraceCheckUtils]: 90: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,649 INFO L290 TraceCheckUtils]: 89: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,649 INFO L290 TraceCheckUtils]: 88: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,649 INFO L290 TraceCheckUtils]: 87: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,650 INFO L290 TraceCheckUtils]: 86: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,650 INFO L290 TraceCheckUtils]: 85: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,650 INFO L290 TraceCheckUtils]: 84: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,650 INFO L290 TraceCheckUtils]: 83: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,651 INFO L290 TraceCheckUtils]: 82: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,651 INFO L290 TraceCheckUtils]: 81: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,651 INFO L290 TraceCheckUtils]: 80: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,652 INFO L290 TraceCheckUtils]: 79: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,652 INFO L290 TraceCheckUtils]: 78: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,652 INFO L290 TraceCheckUtils]: 77: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,652 INFO L290 TraceCheckUtils]: 76: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,653 INFO L290 TraceCheckUtils]: 75: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,653 INFO L290 TraceCheckUtils]: 74: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,653 INFO L290 TraceCheckUtils]: 73: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,653 INFO L290 TraceCheckUtils]: 72: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,654 INFO L290 TraceCheckUtils]: 71: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,654 INFO L290 TraceCheckUtils]: 70: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,654 INFO L290 TraceCheckUtils]: 69: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,654 INFO L290 TraceCheckUtils]: 68: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,655 INFO L290 TraceCheckUtils]: 67: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,655 INFO L290 TraceCheckUtils]: 66: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,655 INFO L290 TraceCheckUtils]: 65: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,655 INFO L290 TraceCheckUtils]: 64: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,656 INFO L290 TraceCheckUtils]: 63: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,656 INFO L290 TraceCheckUtils]: 62: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,656 INFO L290 TraceCheckUtils]: 61: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,656 INFO L290 TraceCheckUtils]: 60: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,657 INFO L290 TraceCheckUtils]: 59: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,657 INFO L290 TraceCheckUtils]: 58: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,657 INFO L290 TraceCheckUtils]: 57: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,658 INFO L290 TraceCheckUtils]: 56: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,658 INFO L290 TraceCheckUtils]: 55: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,658 INFO L290 TraceCheckUtils]: 54: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,658 INFO L290 TraceCheckUtils]: 53: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,659 INFO L290 TraceCheckUtils]: 52: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,659 INFO L290 TraceCheckUtils]: 51: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,659 INFO L290 TraceCheckUtils]: 50: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,659 INFO L290 TraceCheckUtils]: 49: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,660 INFO L290 TraceCheckUtils]: 48: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,660 INFO L290 TraceCheckUtils]: 47: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,660 INFO L290 TraceCheckUtils]: 46: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,660 INFO L290 TraceCheckUtils]: 45: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,661 INFO L290 TraceCheckUtils]: 44: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,661 INFO L290 TraceCheckUtils]: 43: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,661 INFO L290 TraceCheckUtils]: 41: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,662 INFO L290 TraceCheckUtils]: 37: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,663 INFO L290 TraceCheckUtils]: 36: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,663 INFO L290 TraceCheckUtils]: 35: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,663 INFO L290 TraceCheckUtils]: 34: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,664 INFO L290 TraceCheckUtils]: 32: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,664 INFO L290 TraceCheckUtils]: 31: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,664 INFO L290 TraceCheckUtils]: 30: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {41154#(< 2 main_~edgecount~0)} ~i~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {41154#(< 2 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {40040#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-08 03:36:22,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {40040#true} call #t~ret22 := main(); {40040#true} is VALID [2022-04-08 03:36:22,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40040#true} {40040#true} #107#return; {40040#true} is VALID [2022-04-08 03:36:22,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {40040#true} assume true; {40040#true} is VALID [2022-04-08 03:36:22,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {40040#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {40040#true} is VALID [2022-04-08 03:36:22,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {40040#true} call ULTIMATE.init(); {40040#true} is VALID [2022-04-08 03:36:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 15425 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 03:36:22,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747599894] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:36:22,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:36:22,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-04-08 03:36:22,674 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:36:22,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [421858904] [2022-04-08 03:36:22,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [421858904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:36:22,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:36:22,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:36:22,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795546418] [2022-04-08 03:36:22,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:36:22,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 353 [2022-04-08 03:36:22,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:36:22,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:22,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:22,697 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:36:22,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:22,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:36:22,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:36:22,698 INFO L87 Difference]: Start difference. First operand 358 states and 467 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:24,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:24,445 INFO L93 Difference]: Finished difference Result 386 states and 499 transitions. [2022-04-08 03:36:24,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:36:24,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 353 [2022-04-08 03:36:24,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:36:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-08 03:36:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-08 03:36:24,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 102 transitions. [2022-04-08 03:36:24,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:24,536 INFO L225 Difference]: With dead ends: 386 [2022-04-08 03:36:24,537 INFO L226 Difference]: Without dead ends: 375 [2022-04-08 03:36:24,537 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2022-04-08 03:36:24,537 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 127 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:36:24,537 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 39 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:36:24,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-04-08 03:36:25,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 361. [2022-04-08 03:36:25,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:36:25,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 375 states. Second operand has 361 states, 355 states have (on average 1.3098591549295775) internal successors, (465), 355 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:25,966 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand has 361 states, 355 states have (on average 1.3098591549295775) internal successors, (465), 355 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:25,966 INFO L87 Difference]: Start difference. First operand 375 states. Second operand has 361 states, 355 states have (on average 1.3098591549295775) internal successors, (465), 355 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:25,971 INFO L93 Difference]: Finished difference Result 375 states and 487 transitions. [2022-04-08 03:36:25,971 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 487 transitions. [2022-04-08 03:36:25,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:25,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:25,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 361 states, 355 states have (on average 1.3098591549295775) internal successors, (465), 355 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 375 states. [2022-04-08 03:36:25,972 INFO L87 Difference]: Start difference. First operand has 361 states, 355 states have (on average 1.3098591549295775) internal successors, (465), 355 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 375 states. [2022-04-08 03:36:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:25,977 INFO L93 Difference]: Finished difference Result 375 states and 487 transitions. [2022-04-08 03:36:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 487 transitions. [2022-04-08 03:36:25,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:25,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:25,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:36:25,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:36:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 355 states have (on average 1.3098591549295775) internal successors, (465), 355 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 470 transitions. [2022-04-08 03:36:25,983 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 470 transitions. Word has length 353 [2022-04-08 03:36:25,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:36:25,983 INFO L478 AbstractCegarLoop]: Abstraction has 361 states and 470 transitions. [2022-04-08 03:36:25,984 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:25,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 361 states and 470 transitions. [2022-04-08 03:36:26,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 470 transitions. [2022-04-08 03:36:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2022-04-08 03:36:26,780 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:36:26,781 INFO L499 BasicCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:36:26,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-08 03:36:26,983 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-08 03:36:26,983 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:36:26,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:36:26,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1152690534, now seen corresponding path program 57 times [2022-04-08 03:36:26,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:26,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [126050551] [2022-04-08 03:36:26,986 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:36:26,987 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:36:26,987 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:36:26,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1152690534, now seen corresponding path program 58 times [2022-04-08 03:36:26,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:36:26,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403931994] [2022-04-08 03:36:26,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:36:26,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:36:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:27,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:36:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:27,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {44436#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {44426#true} is VALID [2022-04-08 03:36:27,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {44426#true} assume true; {44426#true} is VALID [2022-04-08 03:36:27,307 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44426#true} {44426#true} #107#return; {44426#true} is VALID [2022-04-08 03:36:27,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {44426#true} call ULTIMATE.init(); {44436#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:36:27,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {44436#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {44426#true} is VALID [2022-04-08 03:36:27,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {44426#true} assume true; {44426#true} is VALID [2022-04-08 03:36:27,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44426#true} {44426#true} #107#return; {44426#true} is VALID [2022-04-08 03:36:27,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {44426#true} call #t~ret22 := main(); {44426#true} is VALID [2022-04-08 03:36:27,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {44426#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,316 INFO L290 TraceCheckUtils]: 34: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,317 INFO L290 TraceCheckUtils]: 40: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,319 INFO L290 TraceCheckUtils]: 47: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,319 INFO L290 TraceCheckUtils]: 48: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,320 INFO L290 TraceCheckUtils]: 51: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,320 INFO L290 TraceCheckUtils]: 52: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,320 INFO L290 TraceCheckUtils]: 55: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,322 INFO L290 TraceCheckUtils]: 60: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,322 INFO L290 TraceCheckUtils]: 61: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,322 INFO L290 TraceCheckUtils]: 62: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,322 INFO L290 TraceCheckUtils]: 63: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,322 INFO L290 TraceCheckUtils]: 64: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,323 INFO L290 TraceCheckUtils]: 65: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,323 INFO L290 TraceCheckUtils]: 66: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,323 INFO L290 TraceCheckUtils]: 67: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,323 INFO L290 TraceCheckUtils]: 68: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,324 INFO L290 TraceCheckUtils]: 69: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,325 INFO L290 TraceCheckUtils]: 70: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,325 INFO L290 TraceCheckUtils]: 71: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,325 INFO L290 TraceCheckUtils]: 72: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,325 INFO L290 TraceCheckUtils]: 73: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,325 INFO L290 TraceCheckUtils]: 74: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,326 INFO L290 TraceCheckUtils]: 75: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,326 INFO L290 TraceCheckUtils]: 76: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,326 INFO L290 TraceCheckUtils]: 77: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,326 INFO L290 TraceCheckUtils]: 78: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,327 INFO L290 TraceCheckUtils]: 79: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,327 INFO L290 TraceCheckUtils]: 80: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,327 INFO L290 TraceCheckUtils]: 81: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,327 INFO L290 TraceCheckUtils]: 82: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,327 INFO L290 TraceCheckUtils]: 83: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,328 INFO L290 TraceCheckUtils]: 84: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,328 INFO L290 TraceCheckUtils]: 85: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,328 INFO L290 TraceCheckUtils]: 86: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,328 INFO L290 TraceCheckUtils]: 87: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,328 INFO L290 TraceCheckUtils]: 88: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,329 INFO L290 TraceCheckUtils]: 89: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,329 INFO L290 TraceCheckUtils]: 90: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,329 INFO L290 TraceCheckUtils]: 91: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,329 INFO L290 TraceCheckUtils]: 92: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,329 INFO L290 TraceCheckUtils]: 93: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,330 INFO L290 TraceCheckUtils]: 94: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,330 INFO L290 TraceCheckUtils]: 95: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,330 INFO L290 TraceCheckUtils]: 96: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,330 INFO L290 TraceCheckUtils]: 97: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,330 INFO L290 TraceCheckUtils]: 98: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,331 INFO L290 TraceCheckUtils]: 99: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,331 INFO L290 TraceCheckUtils]: 100: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,331 INFO L290 TraceCheckUtils]: 101: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,331 INFO L290 TraceCheckUtils]: 102: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,331 INFO L290 TraceCheckUtils]: 103: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,332 INFO L290 TraceCheckUtils]: 104: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,332 INFO L290 TraceCheckUtils]: 105: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,332 INFO L290 TraceCheckUtils]: 106: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,332 INFO L290 TraceCheckUtils]: 107: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,333 INFO L290 TraceCheckUtils]: 108: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,333 INFO L290 TraceCheckUtils]: 109: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,333 INFO L290 TraceCheckUtils]: 110: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,333 INFO L290 TraceCheckUtils]: 111: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,333 INFO L290 TraceCheckUtils]: 112: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,334 INFO L290 TraceCheckUtils]: 113: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,334 INFO L290 TraceCheckUtils]: 114: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,334 INFO L290 TraceCheckUtils]: 115: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,334 INFO L290 TraceCheckUtils]: 116: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,334 INFO L290 TraceCheckUtils]: 117: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,335 INFO L290 TraceCheckUtils]: 118: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,335 INFO L290 TraceCheckUtils]: 119: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,335 INFO L290 TraceCheckUtils]: 120: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,335 INFO L290 TraceCheckUtils]: 121: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,335 INFO L290 TraceCheckUtils]: 122: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,336 INFO L290 TraceCheckUtils]: 123: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,336 INFO L290 TraceCheckUtils]: 124: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,336 INFO L290 TraceCheckUtils]: 125: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,336 INFO L290 TraceCheckUtils]: 126: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,336 INFO L290 TraceCheckUtils]: 127: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,337 INFO L290 TraceCheckUtils]: 128: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,337 INFO L290 TraceCheckUtils]: 129: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,337 INFO L290 TraceCheckUtils]: 130: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,337 INFO L290 TraceCheckUtils]: 131: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,337 INFO L290 TraceCheckUtils]: 132: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,338 INFO L290 TraceCheckUtils]: 133: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,338 INFO L290 TraceCheckUtils]: 134: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,338 INFO L290 TraceCheckUtils]: 135: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,338 INFO L290 TraceCheckUtils]: 136: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,339 INFO L290 TraceCheckUtils]: 137: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,339 INFO L290 TraceCheckUtils]: 138: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,339 INFO L290 TraceCheckUtils]: 139: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,339 INFO L290 TraceCheckUtils]: 140: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,339 INFO L290 TraceCheckUtils]: 141: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,340 INFO L290 TraceCheckUtils]: 142: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,340 INFO L290 TraceCheckUtils]: 143: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,340 INFO L290 TraceCheckUtils]: 144: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,340 INFO L290 TraceCheckUtils]: 145: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,340 INFO L290 TraceCheckUtils]: 146: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,341 INFO L290 TraceCheckUtils]: 147: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,341 INFO L290 TraceCheckUtils]: 148: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,341 INFO L290 TraceCheckUtils]: 149: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,341 INFO L290 TraceCheckUtils]: 150: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,341 INFO L290 TraceCheckUtils]: 151: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,342 INFO L290 TraceCheckUtils]: 152: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,342 INFO L290 TraceCheckUtils]: 153: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,342 INFO L290 TraceCheckUtils]: 154: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,342 INFO L290 TraceCheckUtils]: 155: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,342 INFO L290 TraceCheckUtils]: 156: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,343 INFO L290 TraceCheckUtils]: 157: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,343 INFO L290 TraceCheckUtils]: 158: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,343 INFO L290 TraceCheckUtils]: 159: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,343 INFO L290 TraceCheckUtils]: 160: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,344 INFO L290 TraceCheckUtils]: 161: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,344 INFO L290 TraceCheckUtils]: 162: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,344 INFO L290 TraceCheckUtils]: 163: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,344 INFO L290 TraceCheckUtils]: 164: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,344 INFO L290 TraceCheckUtils]: 165: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,345 INFO L290 TraceCheckUtils]: 166: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,345 INFO L290 TraceCheckUtils]: 167: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,345 INFO L290 TraceCheckUtils]: 168: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,345 INFO L290 TraceCheckUtils]: 169: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,345 INFO L290 TraceCheckUtils]: 170: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,346 INFO L290 TraceCheckUtils]: 171: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,346 INFO L290 TraceCheckUtils]: 172: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,346 INFO L290 TraceCheckUtils]: 173: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,346 INFO L290 TraceCheckUtils]: 174: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,346 INFO L290 TraceCheckUtils]: 175: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,347 INFO L290 TraceCheckUtils]: 176: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,347 INFO L290 TraceCheckUtils]: 177: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,347 INFO L290 TraceCheckUtils]: 178: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,347 INFO L290 TraceCheckUtils]: 179: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,347 INFO L290 TraceCheckUtils]: 180: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,348 INFO L290 TraceCheckUtils]: 181: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,348 INFO L290 TraceCheckUtils]: 182: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,348 INFO L290 TraceCheckUtils]: 183: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,348 INFO L290 TraceCheckUtils]: 184: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,349 INFO L290 TraceCheckUtils]: 185: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,349 INFO L290 TraceCheckUtils]: 186: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,349 INFO L290 TraceCheckUtils]: 187: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,349 INFO L290 TraceCheckUtils]: 188: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,349 INFO L290 TraceCheckUtils]: 189: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,350 INFO L290 TraceCheckUtils]: 190: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,350 INFO L290 TraceCheckUtils]: 191: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,350 INFO L290 TraceCheckUtils]: 192: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,350 INFO L290 TraceCheckUtils]: 193: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,350 INFO L290 TraceCheckUtils]: 194: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,351 INFO L290 TraceCheckUtils]: 195: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,351 INFO L290 TraceCheckUtils]: 196: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,351 INFO L290 TraceCheckUtils]: 197: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,351 INFO L290 TraceCheckUtils]: 198: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,351 INFO L290 TraceCheckUtils]: 199: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,352 INFO L290 TraceCheckUtils]: 200: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,352 INFO L290 TraceCheckUtils]: 201: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,352 INFO L290 TraceCheckUtils]: 202: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,352 INFO L290 TraceCheckUtils]: 203: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,352 INFO L290 TraceCheckUtils]: 204: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,353 INFO L290 TraceCheckUtils]: 205: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,353 INFO L290 TraceCheckUtils]: 206: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,353 INFO L290 TraceCheckUtils]: 207: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,353 INFO L290 TraceCheckUtils]: 208: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,354 INFO L290 TraceCheckUtils]: 209: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,354 INFO L290 TraceCheckUtils]: 210: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,354 INFO L290 TraceCheckUtils]: 211: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,354 INFO L290 TraceCheckUtils]: 212: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,354 INFO L290 TraceCheckUtils]: 213: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,355 INFO L290 TraceCheckUtils]: 214: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,355 INFO L290 TraceCheckUtils]: 215: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,355 INFO L290 TraceCheckUtils]: 216: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,355 INFO L290 TraceCheckUtils]: 217: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,355 INFO L290 TraceCheckUtils]: 218: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,356 INFO L290 TraceCheckUtils]: 219: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,356 INFO L290 TraceCheckUtils]: 220: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,356 INFO L290 TraceCheckUtils]: 221: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,356 INFO L290 TraceCheckUtils]: 222: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,356 INFO L290 TraceCheckUtils]: 223: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,357 INFO L290 TraceCheckUtils]: 224: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,357 INFO L290 TraceCheckUtils]: 225: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,357 INFO L290 TraceCheckUtils]: 226: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,357 INFO L290 TraceCheckUtils]: 227: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,357 INFO L290 TraceCheckUtils]: 228: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,358 INFO L290 TraceCheckUtils]: 229: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,358 INFO L290 TraceCheckUtils]: 230: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,358 INFO L290 TraceCheckUtils]: 231: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,358 INFO L290 TraceCheckUtils]: 232: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,358 INFO L290 TraceCheckUtils]: 233: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,359 INFO L290 TraceCheckUtils]: 234: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,359 INFO L290 TraceCheckUtils]: 235: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,359 INFO L290 TraceCheckUtils]: 236: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,359 INFO L290 TraceCheckUtils]: 237: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,360 INFO L290 TraceCheckUtils]: 238: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,360 INFO L290 TraceCheckUtils]: 239: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,360 INFO L290 TraceCheckUtils]: 240: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,360 INFO L290 TraceCheckUtils]: 241: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,360 INFO L290 TraceCheckUtils]: 242: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,361 INFO L290 TraceCheckUtils]: 243: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,361 INFO L290 TraceCheckUtils]: 244: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,361 INFO L290 TraceCheckUtils]: 245: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,361 INFO L290 TraceCheckUtils]: 246: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,361 INFO L290 TraceCheckUtils]: 247: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,362 INFO L290 TraceCheckUtils]: 248: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,362 INFO L290 TraceCheckUtils]: 249: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,362 INFO L290 TraceCheckUtils]: 250: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,362 INFO L290 TraceCheckUtils]: 251: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,362 INFO L290 TraceCheckUtils]: 252: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,363 INFO L290 TraceCheckUtils]: 253: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,363 INFO L290 TraceCheckUtils]: 254: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,363 INFO L290 TraceCheckUtils]: 255: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,363 INFO L290 TraceCheckUtils]: 256: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,363 INFO L290 TraceCheckUtils]: 257: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,364 INFO L290 TraceCheckUtils]: 258: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,364 INFO L290 TraceCheckUtils]: 259: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,364 INFO L290 TraceCheckUtils]: 260: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,364 INFO L290 TraceCheckUtils]: 261: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,364 INFO L290 TraceCheckUtils]: 262: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,365 INFO L290 TraceCheckUtils]: 263: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,365 INFO L290 TraceCheckUtils]: 264: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,365 INFO L290 TraceCheckUtils]: 265: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,365 INFO L290 TraceCheckUtils]: 266: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,366 INFO L290 TraceCheckUtils]: 267: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,366 INFO L290 TraceCheckUtils]: 268: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,366 INFO L290 TraceCheckUtils]: 269: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,366 INFO L290 TraceCheckUtils]: 270: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,366 INFO L290 TraceCheckUtils]: 271: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,367 INFO L290 TraceCheckUtils]: 272: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,367 INFO L290 TraceCheckUtils]: 273: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,367 INFO L290 TraceCheckUtils]: 274: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,367 INFO L290 TraceCheckUtils]: 275: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,367 INFO L290 TraceCheckUtils]: 276: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,368 INFO L290 TraceCheckUtils]: 277: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,368 INFO L290 TraceCheckUtils]: 278: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,368 INFO L290 TraceCheckUtils]: 279: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,368 INFO L290 TraceCheckUtils]: 280: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,368 INFO L290 TraceCheckUtils]: 281: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,369 INFO L290 TraceCheckUtils]: 282: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,369 INFO L290 TraceCheckUtils]: 283: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,369 INFO L290 TraceCheckUtils]: 284: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,369 INFO L290 TraceCheckUtils]: 285: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,369 INFO L290 TraceCheckUtils]: 286: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,370 INFO L290 TraceCheckUtils]: 287: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,370 INFO L290 TraceCheckUtils]: 288: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,370 INFO L290 TraceCheckUtils]: 289: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,370 INFO L290 TraceCheckUtils]: 290: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,371 INFO L290 TraceCheckUtils]: 291: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,371 INFO L290 TraceCheckUtils]: 292: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,371 INFO L290 TraceCheckUtils]: 293: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,371 INFO L290 TraceCheckUtils]: 294: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,371 INFO L290 TraceCheckUtils]: 295: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,372 INFO L290 TraceCheckUtils]: 296: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,372 INFO L290 TraceCheckUtils]: 297: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,372 INFO L290 TraceCheckUtils]: 298: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,372 INFO L290 TraceCheckUtils]: 299: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,372 INFO L290 TraceCheckUtils]: 300: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,373 INFO L290 TraceCheckUtils]: 301: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,373 INFO L290 TraceCheckUtils]: 302: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,373 INFO L290 TraceCheckUtils]: 303: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,373 INFO L290 TraceCheckUtils]: 304: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,373 INFO L290 TraceCheckUtils]: 305: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,374 INFO L290 TraceCheckUtils]: 306: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,374 INFO L290 TraceCheckUtils]: 307: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,374 INFO L290 TraceCheckUtils]: 308: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,374 INFO L290 TraceCheckUtils]: 309: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,374 INFO L290 TraceCheckUtils]: 310: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,375 INFO L290 TraceCheckUtils]: 311: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,375 INFO L290 TraceCheckUtils]: 312: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,375 INFO L290 TraceCheckUtils]: 313: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,375 INFO L290 TraceCheckUtils]: 314: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,376 INFO L290 TraceCheckUtils]: 315: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,376 INFO L290 TraceCheckUtils]: 316: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,376 INFO L290 TraceCheckUtils]: 317: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,376 INFO L290 TraceCheckUtils]: 318: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,376 INFO L290 TraceCheckUtils]: 319: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,377 INFO L290 TraceCheckUtils]: 320: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,377 INFO L290 TraceCheckUtils]: 321: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,377 INFO L290 TraceCheckUtils]: 322: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,377 INFO L290 TraceCheckUtils]: 323: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,377 INFO L290 TraceCheckUtils]: 324: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,378 INFO L290 TraceCheckUtils]: 325: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,378 INFO L290 TraceCheckUtils]: 326: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,378 INFO L290 TraceCheckUtils]: 327: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,378 INFO L290 TraceCheckUtils]: 328: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,378 INFO L290 TraceCheckUtils]: 329: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,379 INFO L290 TraceCheckUtils]: 330: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,379 INFO L290 TraceCheckUtils]: 331: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,379 INFO L290 TraceCheckUtils]: 332: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,379 INFO L290 TraceCheckUtils]: 333: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,379 INFO L290 TraceCheckUtils]: 334: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,380 INFO L290 TraceCheckUtils]: 335: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,380 INFO L290 TraceCheckUtils]: 336: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,380 INFO L290 TraceCheckUtils]: 337: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,380 INFO L290 TraceCheckUtils]: 338: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:27,381 INFO L290 TraceCheckUtils]: 339: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {44432#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:27,381 INFO L290 TraceCheckUtils]: 340: Hoare triple {44432#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {44432#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:27,381 INFO L290 TraceCheckUtils]: 341: Hoare triple {44432#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {44432#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:27,382 INFO L290 TraceCheckUtils]: 342: Hoare triple {44432#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {44433#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:36:27,382 INFO L290 TraceCheckUtils]: 343: Hoare triple {44433#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {44433#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:36:27,382 INFO L290 TraceCheckUtils]: 344: Hoare triple {44433#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {44433#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:36:27,383 INFO L290 TraceCheckUtils]: 345: Hoare triple {44433#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {44434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:27,383 INFO L290 TraceCheckUtils]: 346: Hoare triple {44434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {44434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:27,383 INFO L290 TraceCheckUtils]: 347: Hoare triple {44434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {44434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:27,384 INFO L290 TraceCheckUtils]: 348: Hoare triple {44434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {44435#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:27,384 INFO L290 TraceCheckUtils]: 349: Hoare triple {44435#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} assume !(~i~0 < ~edgecount~0); {44427#false} is VALID [2022-04-08 03:36:27,384 INFO L290 TraceCheckUtils]: 350: Hoare triple {44427#false} ~i~0 := 0; {44427#false} is VALID [2022-04-08 03:36:27,384 INFO L290 TraceCheckUtils]: 351: Hoare triple {44427#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44427#false} is VALID [2022-04-08 03:36:27,384 INFO L272 TraceCheckUtils]: 352: Hoare triple {44427#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {44427#false} is VALID [2022-04-08 03:36:27,384 INFO L290 TraceCheckUtils]: 353: Hoare triple {44427#false} ~cond := #in~cond; {44427#false} is VALID [2022-04-08 03:36:27,384 INFO L290 TraceCheckUtils]: 354: Hoare triple {44427#false} assume 0 == ~cond; {44427#false} is VALID [2022-04-08 03:36:27,384 INFO L290 TraceCheckUtils]: 355: Hoare triple {44427#false} assume !false; {44427#false} is VALID [2022-04-08 03:36:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 15432 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 03:36:27,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:36:27,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403931994] [2022-04-08 03:36:27,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403931994] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:36:27,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694706265] [2022-04-08 03:36:27,386 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:36:27,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:36:27,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:36:27,387 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:36:27,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-08 03:36:27,895 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:36:27,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:36:27,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 03:36:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:27,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:36:29,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {44426#true} call ULTIMATE.init(); {44426#true} is VALID [2022-04-08 03:36:29,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {44426#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {44426#true} is VALID [2022-04-08 03:36:29,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {44426#true} assume true; {44426#true} is VALID [2022-04-08 03:36:29,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44426#true} {44426#true} #107#return; {44426#true} is VALID [2022-04-08 03:36:29,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {44426#true} call #t~ret22 := main(); {44426#true} is VALID [2022-04-08 03:36:29,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {44426#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {44426#true} is VALID [2022-04-08 03:36:29,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 03:36:29,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {44426#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 03:36:29,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 03:36:29,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 03:36:29,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 03:36:29,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 03:36:29,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 03:36:29,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 03:36:29,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 03:36:29,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 03:36:29,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 03:36:29,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 03:36:29,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 03:36:29,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 03:36:29,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 03:36:29,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {44426#true} assume !(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 03:36:29,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {44426#true} ~i~0 := 0; {44426#true} is VALID [2022-04-08 03:36:29,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44509#(<= 0 main_~j~0)} is VALID [2022-04-08 03:36:29,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {44509#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44509#(<= 0 main_~j~0)} is VALID [2022-04-08 03:36:29,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {44509#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44509#(<= 0 main_~j~0)} is VALID [2022-04-08 03:36:29,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {44509#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44519#(<= 1 main_~j~0)} is VALID [2022-04-08 03:36:29,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {44519#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44519#(<= 1 main_~j~0)} is VALID [2022-04-08 03:36:29,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {44519#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44519#(<= 1 main_~j~0)} is VALID [2022-04-08 03:36:29,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {44519#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44529#(<= 2 main_~j~0)} is VALID [2022-04-08 03:36:29,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {44529#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44529#(<= 2 main_~j~0)} is VALID [2022-04-08 03:36:29,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {44529#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44529#(<= 2 main_~j~0)} is VALID [2022-04-08 03:36:29,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {44529#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44539#(<= 3 main_~j~0)} is VALID [2022-04-08 03:36:29,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {44539#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44539#(<= 3 main_~j~0)} is VALID [2022-04-08 03:36:29,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {44539#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44539#(<= 3 main_~j~0)} is VALID [2022-04-08 03:36:29,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {44539#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44549#(<= 4 main_~j~0)} is VALID [2022-04-08 03:36:29,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {44549#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44549#(<= 4 main_~j~0)} is VALID [2022-04-08 03:36:29,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {44549#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44549#(<= 4 main_~j~0)} is VALID [2022-04-08 03:36:29,369 INFO L290 TraceCheckUtils]: 38: Hoare triple {44549#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44559#(<= 5 main_~j~0)} is VALID [2022-04-08 03:36:29,369 INFO L290 TraceCheckUtils]: 39: Hoare triple {44559#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44559#(<= 5 main_~j~0)} is VALID [2022-04-08 03:36:29,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {44559#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44559#(<= 5 main_~j~0)} is VALID [2022-04-08 03:36:29,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {44559#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44569#(<= 6 main_~j~0)} is VALID [2022-04-08 03:36:29,370 INFO L290 TraceCheckUtils]: 42: Hoare triple {44569#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44569#(<= 6 main_~j~0)} is VALID [2022-04-08 03:36:29,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {44569#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44569#(<= 6 main_~j~0)} is VALID [2022-04-08 03:36:29,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {44569#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44579#(<= 7 main_~j~0)} is VALID [2022-04-08 03:36:29,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {44579#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44579#(<= 7 main_~j~0)} is VALID [2022-04-08 03:36:29,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {44579#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44579#(<= 7 main_~j~0)} is VALID [2022-04-08 03:36:29,372 INFO L290 TraceCheckUtils]: 47: Hoare triple {44579#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44589#(<= 8 main_~j~0)} is VALID [2022-04-08 03:36:29,372 INFO L290 TraceCheckUtils]: 48: Hoare triple {44589#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44589#(<= 8 main_~j~0)} is VALID [2022-04-08 03:36:29,372 INFO L290 TraceCheckUtils]: 49: Hoare triple {44589#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44589#(<= 8 main_~j~0)} is VALID [2022-04-08 03:36:29,372 INFO L290 TraceCheckUtils]: 50: Hoare triple {44589#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44599#(<= 9 main_~j~0)} is VALID [2022-04-08 03:36:29,373 INFO L290 TraceCheckUtils]: 51: Hoare triple {44599#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44599#(<= 9 main_~j~0)} is VALID [2022-04-08 03:36:29,373 INFO L290 TraceCheckUtils]: 52: Hoare triple {44599#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44599#(<= 9 main_~j~0)} is VALID [2022-04-08 03:36:29,373 INFO L290 TraceCheckUtils]: 53: Hoare triple {44599#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44609#(<= 10 main_~j~0)} is VALID [2022-04-08 03:36:29,373 INFO L290 TraceCheckUtils]: 54: Hoare triple {44609#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44609#(<= 10 main_~j~0)} is VALID [2022-04-08 03:36:29,374 INFO L290 TraceCheckUtils]: 55: Hoare triple {44609#(<= 10 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44609#(<= 10 main_~j~0)} is VALID [2022-04-08 03:36:29,374 INFO L290 TraceCheckUtils]: 56: Hoare triple {44609#(<= 10 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44619#(<= 11 main_~j~0)} is VALID [2022-04-08 03:36:29,374 INFO L290 TraceCheckUtils]: 57: Hoare triple {44619#(<= 11 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44619#(<= 11 main_~j~0)} is VALID [2022-04-08 03:36:29,374 INFO L290 TraceCheckUtils]: 58: Hoare triple {44619#(<= 11 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44619#(<= 11 main_~j~0)} is VALID [2022-04-08 03:36:29,375 INFO L290 TraceCheckUtils]: 59: Hoare triple {44619#(<= 11 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44629#(<= 12 main_~j~0)} is VALID [2022-04-08 03:36:29,375 INFO L290 TraceCheckUtils]: 60: Hoare triple {44629#(<= 12 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44629#(<= 12 main_~j~0)} is VALID [2022-04-08 03:36:29,375 INFO L290 TraceCheckUtils]: 61: Hoare triple {44629#(<= 12 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44629#(<= 12 main_~j~0)} is VALID [2022-04-08 03:36:29,376 INFO L290 TraceCheckUtils]: 62: Hoare triple {44629#(<= 12 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44639#(<= 13 main_~j~0)} is VALID [2022-04-08 03:36:29,376 INFO L290 TraceCheckUtils]: 63: Hoare triple {44639#(<= 13 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44639#(<= 13 main_~j~0)} is VALID [2022-04-08 03:36:29,376 INFO L290 TraceCheckUtils]: 64: Hoare triple {44639#(<= 13 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44639#(<= 13 main_~j~0)} is VALID [2022-04-08 03:36:29,376 INFO L290 TraceCheckUtils]: 65: Hoare triple {44639#(<= 13 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44649#(<= 14 main_~j~0)} is VALID [2022-04-08 03:36:29,377 INFO L290 TraceCheckUtils]: 66: Hoare triple {44649#(<= 14 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44649#(<= 14 main_~j~0)} is VALID [2022-04-08 03:36:29,377 INFO L290 TraceCheckUtils]: 67: Hoare triple {44649#(<= 14 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44649#(<= 14 main_~j~0)} is VALID [2022-04-08 03:36:29,377 INFO L290 TraceCheckUtils]: 68: Hoare triple {44649#(<= 14 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44659#(<= 15 main_~j~0)} is VALID [2022-04-08 03:36:29,377 INFO L290 TraceCheckUtils]: 69: Hoare triple {44659#(<= 15 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44659#(<= 15 main_~j~0)} is VALID [2022-04-08 03:36:29,378 INFO L290 TraceCheckUtils]: 70: Hoare triple {44659#(<= 15 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44659#(<= 15 main_~j~0)} is VALID [2022-04-08 03:36:29,378 INFO L290 TraceCheckUtils]: 71: Hoare triple {44659#(<= 15 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44669#(<= 16 main_~j~0)} is VALID [2022-04-08 03:36:29,378 INFO L290 TraceCheckUtils]: 72: Hoare triple {44669#(<= 16 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44669#(<= 16 main_~j~0)} is VALID [2022-04-08 03:36:29,379 INFO L290 TraceCheckUtils]: 73: Hoare triple {44669#(<= 16 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44669#(<= 16 main_~j~0)} is VALID [2022-04-08 03:36:29,379 INFO L290 TraceCheckUtils]: 74: Hoare triple {44669#(<= 16 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44679#(<= 17 main_~j~0)} is VALID [2022-04-08 03:36:29,379 INFO L290 TraceCheckUtils]: 75: Hoare triple {44679#(<= 17 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44679#(<= 17 main_~j~0)} is VALID [2022-04-08 03:36:29,379 INFO L290 TraceCheckUtils]: 76: Hoare triple {44679#(<= 17 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44679#(<= 17 main_~j~0)} is VALID [2022-04-08 03:36:29,380 INFO L290 TraceCheckUtils]: 77: Hoare triple {44679#(<= 17 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44689#(<= 18 main_~j~0)} is VALID [2022-04-08 03:36:29,380 INFO L290 TraceCheckUtils]: 78: Hoare triple {44689#(<= 18 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44689#(<= 18 main_~j~0)} is VALID [2022-04-08 03:36:29,380 INFO L290 TraceCheckUtils]: 79: Hoare triple {44689#(<= 18 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44689#(<= 18 main_~j~0)} is VALID [2022-04-08 03:36:29,381 INFO L290 TraceCheckUtils]: 80: Hoare triple {44689#(<= 18 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44699#(<= 19 main_~j~0)} is VALID [2022-04-08 03:36:29,381 INFO L290 TraceCheckUtils]: 81: Hoare triple {44699#(<= 19 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,381 INFO L290 TraceCheckUtils]: 82: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,382 INFO L290 TraceCheckUtils]: 83: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,382 INFO L290 TraceCheckUtils]: 84: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,382 INFO L290 TraceCheckUtils]: 85: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,382 INFO L290 TraceCheckUtils]: 86: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,382 INFO L290 TraceCheckUtils]: 87: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,383 INFO L290 TraceCheckUtils]: 88: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,383 INFO L290 TraceCheckUtils]: 89: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,383 INFO L290 TraceCheckUtils]: 90: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,383 INFO L290 TraceCheckUtils]: 91: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,384 INFO L290 TraceCheckUtils]: 92: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,384 INFO L290 TraceCheckUtils]: 93: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,384 INFO L290 TraceCheckUtils]: 94: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,384 INFO L290 TraceCheckUtils]: 95: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,385 INFO L290 TraceCheckUtils]: 96: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,385 INFO L290 TraceCheckUtils]: 97: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,385 INFO L290 TraceCheckUtils]: 98: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,385 INFO L290 TraceCheckUtils]: 99: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,386 INFO L290 TraceCheckUtils]: 100: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,386 INFO L290 TraceCheckUtils]: 101: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,386 INFO L290 TraceCheckUtils]: 102: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,386 INFO L290 TraceCheckUtils]: 103: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,387 INFO L290 TraceCheckUtils]: 104: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,387 INFO L290 TraceCheckUtils]: 105: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,387 INFO L290 TraceCheckUtils]: 106: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,387 INFO L290 TraceCheckUtils]: 107: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,388 INFO L290 TraceCheckUtils]: 108: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,388 INFO L290 TraceCheckUtils]: 109: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,388 INFO L290 TraceCheckUtils]: 110: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,388 INFO L290 TraceCheckUtils]: 111: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,388 INFO L290 TraceCheckUtils]: 112: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,389 INFO L290 TraceCheckUtils]: 113: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,389 INFO L290 TraceCheckUtils]: 114: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,389 INFO L290 TraceCheckUtils]: 115: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,389 INFO L290 TraceCheckUtils]: 116: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,390 INFO L290 TraceCheckUtils]: 117: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,390 INFO L290 TraceCheckUtils]: 118: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,390 INFO L290 TraceCheckUtils]: 119: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,390 INFO L290 TraceCheckUtils]: 120: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,391 INFO L290 TraceCheckUtils]: 121: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,391 INFO L290 TraceCheckUtils]: 122: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,391 INFO L290 TraceCheckUtils]: 123: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,391 INFO L290 TraceCheckUtils]: 124: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,392 INFO L290 TraceCheckUtils]: 125: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,392 INFO L290 TraceCheckUtils]: 126: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,392 INFO L290 TraceCheckUtils]: 127: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,392 INFO L290 TraceCheckUtils]: 128: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,392 INFO L290 TraceCheckUtils]: 129: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,393 INFO L290 TraceCheckUtils]: 130: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,393 INFO L290 TraceCheckUtils]: 131: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,393 INFO L290 TraceCheckUtils]: 132: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,393 INFO L290 TraceCheckUtils]: 133: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,394 INFO L290 TraceCheckUtils]: 134: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,394 INFO L290 TraceCheckUtils]: 135: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,394 INFO L290 TraceCheckUtils]: 136: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,394 INFO L290 TraceCheckUtils]: 137: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,395 INFO L290 TraceCheckUtils]: 138: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,395 INFO L290 TraceCheckUtils]: 139: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,395 INFO L290 TraceCheckUtils]: 140: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,395 INFO L290 TraceCheckUtils]: 141: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,396 INFO L290 TraceCheckUtils]: 142: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,396 INFO L290 TraceCheckUtils]: 143: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,396 INFO L290 TraceCheckUtils]: 144: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,396 INFO L290 TraceCheckUtils]: 145: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,396 INFO L290 TraceCheckUtils]: 146: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,397 INFO L290 TraceCheckUtils]: 147: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,397 INFO L290 TraceCheckUtils]: 148: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,397 INFO L290 TraceCheckUtils]: 149: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,397 INFO L290 TraceCheckUtils]: 150: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,398 INFO L290 TraceCheckUtils]: 151: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,398 INFO L290 TraceCheckUtils]: 152: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,398 INFO L290 TraceCheckUtils]: 153: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,398 INFO L290 TraceCheckUtils]: 154: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,399 INFO L290 TraceCheckUtils]: 155: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,399 INFO L290 TraceCheckUtils]: 156: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,399 INFO L290 TraceCheckUtils]: 157: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,399 INFO L290 TraceCheckUtils]: 158: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,400 INFO L290 TraceCheckUtils]: 159: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,400 INFO L290 TraceCheckUtils]: 160: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,400 INFO L290 TraceCheckUtils]: 161: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,400 INFO L290 TraceCheckUtils]: 162: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,400 INFO L290 TraceCheckUtils]: 163: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,401 INFO L290 TraceCheckUtils]: 164: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,401 INFO L290 TraceCheckUtils]: 165: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,401 INFO L290 TraceCheckUtils]: 166: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,401 INFO L290 TraceCheckUtils]: 167: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,402 INFO L290 TraceCheckUtils]: 168: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,402 INFO L290 TraceCheckUtils]: 169: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,402 INFO L290 TraceCheckUtils]: 170: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,402 INFO L290 TraceCheckUtils]: 171: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,403 INFO L290 TraceCheckUtils]: 172: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,403 INFO L290 TraceCheckUtils]: 173: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,403 INFO L290 TraceCheckUtils]: 174: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,403 INFO L290 TraceCheckUtils]: 175: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,404 INFO L290 TraceCheckUtils]: 176: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,404 INFO L290 TraceCheckUtils]: 177: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,404 INFO L290 TraceCheckUtils]: 178: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,404 INFO L290 TraceCheckUtils]: 179: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,404 INFO L290 TraceCheckUtils]: 180: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,405 INFO L290 TraceCheckUtils]: 181: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,405 INFO L290 TraceCheckUtils]: 182: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,405 INFO L290 TraceCheckUtils]: 183: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,405 INFO L290 TraceCheckUtils]: 184: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,406 INFO L290 TraceCheckUtils]: 185: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,406 INFO L290 TraceCheckUtils]: 186: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,406 INFO L290 TraceCheckUtils]: 187: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,406 INFO L290 TraceCheckUtils]: 188: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,407 INFO L290 TraceCheckUtils]: 189: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,407 INFO L290 TraceCheckUtils]: 190: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,407 INFO L290 TraceCheckUtils]: 191: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,407 INFO L290 TraceCheckUtils]: 192: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,407 INFO L290 TraceCheckUtils]: 193: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,408 INFO L290 TraceCheckUtils]: 194: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,408 INFO L290 TraceCheckUtils]: 195: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,408 INFO L290 TraceCheckUtils]: 196: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,408 INFO L290 TraceCheckUtils]: 197: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,409 INFO L290 TraceCheckUtils]: 198: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,409 INFO L290 TraceCheckUtils]: 199: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,409 INFO L290 TraceCheckUtils]: 200: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,409 INFO L290 TraceCheckUtils]: 201: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,410 INFO L290 TraceCheckUtils]: 202: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,410 INFO L290 TraceCheckUtils]: 203: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,410 INFO L290 TraceCheckUtils]: 204: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,410 INFO L290 TraceCheckUtils]: 205: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,410 INFO L290 TraceCheckUtils]: 206: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,411 INFO L290 TraceCheckUtils]: 207: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,411 INFO L290 TraceCheckUtils]: 208: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,411 INFO L290 TraceCheckUtils]: 209: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,411 INFO L290 TraceCheckUtils]: 210: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,412 INFO L290 TraceCheckUtils]: 211: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,412 INFO L290 TraceCheckUtils]: 212: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,412 INFO L290 TraceCheckUtils]: 213: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,412 INFO L290 TraceCheckUtils]: 214: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,413 INFO L290 TraceCheckUtils]: 215: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,413 INFO L290 TraceCheckUtils]: 216: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,413 INFO L290 TraceCheckUtils]: 217: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,413 INFO L290 TraceCheckUtils]: 218: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,414 INFO L290 TraceCheckUtils]: 219: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,414 INFO L290 TraceCheckUtils]: 220: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,414 INFO L290 TraceCheckUtils]: 221: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,414 INFO L290 TraceCheckUtils]: 222: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,414 INFO L290 TraceCheckUtils]: 223: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,415 INFO L290 TraceCheckUtils]: 224: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,415 INFO L290 TraceCheckUtils]: 225: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,415 INFO L290 TraceCheckUtils]: 226: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,415 INFO L290 TraceCheckUtils]: 227: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,416 INFO L290 TraceCheckUtils]: 228: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,416 INFO L290 TraceCheckUtils]: 229: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,416 INFO L290 TraceCheckUtils]: 230: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,416 INFO L290 TraceCheckUtils]: 231: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,417 INFO L290 TraceCheckUtils]: 232: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,417 INFO L290 TraceCheckUtils]: 233: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,417 INFO L290 TraceCheckUtils]: 234: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,417 INFO L290 TraceCheckUtils]: 235: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,418 INFO L290 TraceCheckUtils]: 236: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,418 INFO L290 TraceCheckUtils]: 237: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,418 INFO L290 TraceCheckUtils]: 238: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,418 INFO L290 TraceCheckUtils]: 239: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,419 INFO L290 TraceCheckUtils]: 240: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,419 INFO L290 TraceCheckUtils]: 241: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,419 INFO L290 TraceCheckUtils]: 242: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,419 INFO L290 TraceCheckUtils]: 243: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,420 INFO L290 TraceCheckUtils]: 244: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,420 INFO L290 TraceCheckUtils]: 245: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,420 INFO L290 TraceCheckUtils]: 246: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,420 INFO L290 TraceCheckUtils]: 247: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,420 INFO L290 TraceCheckUtils]: 248: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,421 INFO L290 TraceCheckUtils]: 249: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,421 INFO L290 TraceCheckUtils]: 250: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,421 INFO L290 TraceCheckUtils]: 251: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,421 INFO L290 TraceCheckUtils]: 252: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,422 INFO L290 TraceCheckUtils]: 253: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,422 INFO L290 TraceCheckUtils]: 254: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,422 INFO L290 TraceCheckUtils]: 255: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,422 INFO L290 TraceCheckUtils]: 256: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,423 INFO L290 TraceCheckUtils]: 257: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,423 INFO L290 TraceCheckUtils]: 258: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,423 INFO L290 TraceCheckUtils]: 259: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,423 INFO L290 TraceCheckUtils]: 260: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,424 INFO L290 TraceCheckUtils]: 261: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,424 INFO L290 TraceCheckUtils]: 262: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,424 INFO L290 TraceCheckUtils]: 263: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,424 INFO L290 TraceCheckUtils]: 264: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,425 INFO L290 TraceCheckUtils]: 265: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,425 INFO L290 TraceCheckUtils]: 266: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,425 INFO L290 TraceCheckUtils]: 267: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,425 INFO L290 TraceCheckUtils]: 268: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,426 INFO L290 TraceCheckUtils]: 269: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,426 INFO L290 TraceCheckUtils]: 270: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,426 INFO L290 TraceCheckUtils]: 271: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,426 INFO L290 TraceCheckUtils]: 272: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,426 INFO L290 TraceCheckUtils]: 273: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,427 INFO L290 TraceCheckUtils]: 274: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,427 INFO L290 TraceCheckUtils]: 275: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,427 INFO L290 TraceCheckUtils]: 276: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,427 INFO L290 TraceCheckUtils]: 277: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,428 INFO L290 TraceCheckUtils]: 278: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,428 INFO L290 TraceCheckUtils]: 279: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,428 INFO L290 TraceCheckUtils]: 280: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,428 INFO L290 TraceCheckUtils]: 281: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,429 INFO L290 TraceCheckUtils]: 282: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,429 INFO L290 TraceCheckUtils]: 283: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,429 INFO L290 TraceCheckUtils]: 284: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,429 INFO L290 TraceCheckUtils]: 285: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,430 INFO L290 TraceCheckUtils]: 286: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,430 INFO L290 TraceCheckUtils]: 287: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,430 INFO L290 TraceCheckUtils]: 288: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,430 INFO L290 TraceCheckUtils]: 289: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,430 INFO L290 TraceCheckUtils]: 290: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,431 INFO L290 TraceCheckUtils]: 291: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,431 INFO L290 TraceCheckUtils]: 292: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,431 INFO L290 TraceCheckUtils]: 293: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,431 INFO L290 TraceCheckUtils]: 294: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,432 INFO L290 TraceCheckUtils]: 295: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,432 INFO L290 TraceCheckUtils]: 296: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,432 INFO L290 TraceCheckUtils]: 297: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,432 INFO L290 TraceCheckUtils]: 298: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,433 INFO L290 TraceCheckUtils]: 299: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,433 INFO L290 TraceCheckUtils]: 300: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,433 INFO L290 TraceCheckUtils]: 301: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,433 INFO L290 TraceCheckUtils]: 302: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,433 INFO L290 TraceCheckUtils]: 303: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,434 INFO L290 TraceCheckUtils]: 304: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,434 INFO L290 TraceCheckUtils]: 305: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,434 INFO L290 TraceCheckUtils]: 306: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,434 INFO L290 TraceCheckUtils]: 307: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,435 INFO L290 TraceCheckUtils]: 308: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,435 INFO L290 TraceCheckUtils]: 309: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,435 INFO L290 TraceCheckUtils]: 310: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,435 INFO L290 TraceCheckUtils]: 311: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,436 INFO L290 TraceCheckUtils]: 312: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,436 INFO L290 TraceCheckUtils]: 313: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,436 INFO L290 TraceCheckUtils]: 314: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,436 INFO L290 TraceCheckUtils]: 315: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,437 INFO L290 TraceCheckUtils]: 316: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,437 INFO L290 TraceCheckUtils]: 317: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,437 INFO L290 TraceCheckUtils]: 318: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,437 INFO L290 TraceCheckUtils]: 319: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,437 INFO L290 TraceCheckUtils]: 320: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,438 INFO L290 TraceCheckUtils]: 321: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,438 INFO L290 TraceCheckUtils]: 322: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,438 INFO L290 TraceCheckUtils]: 323: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,438 INFO L290 TraceCheckUtils]: 324: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,439 INFO L290 TraceCheckUtils]: 325: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,439 INFO L290 TraceCheckUtils]: 326: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,439 INFO L290 TraceCheckUtils]: 327: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,439 INFO L290 TraceCheckUtils]: 328: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,440 INFO L290 TraceCheckUtils]: 329: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,440 INFO L290 TraceCheckUtils]: 330: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,440 INFO L290 TraceCheckUtils]: 331: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,440 INFO L290 TraceCheckUtils]: 332: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,441 INFO L290 TraceCheckUtils]: 333: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,441 INFO L290 TraceCheckUtils]: 334: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,441 INFO L290 TraceCheckUtils]: 335: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,441 INFO L290 TraceCheckUtils]: 336: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,441 INFO L290 TraceCheckUtils]: 337: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,442 INFO L290 TraceCheckUtils]: 338: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:29,442 INFO L290 TraceCheckUtils]: 339: Hoare triple {44703#(< 19 main_~edgecount~0)} ~i~0 := 0; {45478#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 03:36:29,442 INFO L290 TraceCheckUtils]: 340: Hoare triple {45478#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {45478#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 03:36:29,443 INFO L290 TraceCheckUtils]: 341: Hoare triple {45478#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {45478#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 03:36:29,443 INFO L290 TraceCheckUtils]: 342: Hoare triple {45478#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {45488#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 03:36:29,444 INFO L290 TraceCheckUtils]: 343: Hoare triple {45488#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {45488#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 03:36:29,444 INFO L290 TraceCheckUtils]: 344: Hoare triple {45488#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {45488#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 03:36:29,444 INFO L290 TraceCheckUtils]: 345: Hoare triple {45488#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {45498#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:29,445 INFO L290 TraceCheckUtils]: 346: Hoare triple {45498#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {45498#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:29,445 INFO L290 TraceCheckUtils]: 347: Hoare triple {45498#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {45498#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:29,445 INFO L290 TraceCheckUtils]: 348: Hoare triple {45498#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {45508#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:29,446 INFO L290 TraceCheckUtils]: 349: Hoare triple {45508#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} assume !(~i~0 < ~edgecount~0); {44427#false} is VALID [2022-04-08 03:36:29,446 INFO L290 TraceCheckUtils]: 350: Hoare triple {44427#false} ~i~0 := 0; {44427#false} is VALID [2022-04-08 03:36:29,446 INFO L290 TraceCheckUtils]: 351: Hoare triple {44427#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44427#false} is VALID [2022-04-08 03:36:29,446 INFO L272 TraceCheckUtils]: 352: Hoare triple {44427#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {44427#false} is VALID [2022-04-08 03:36:29,446 INFO L290 TraceCheckUtils]: 353: Hoare triple {44427#false} ~cond := #in~cond; {44427#false} is VALID [2022-04-08 03:36:29,446 INFO L290 TraceCheckUtils]: 354: Hoare triple {44427#false} assume 0 == ~cond; {44427#false} is VALID [2022-04-08 03:36:29,446 INFO L290 TraceCheckUtils]: 355: Hoare triple {44427#false} assume !false; {44427#false} is VALID [2022-04-08 03:36:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15432 backedges. 537 proven. 4790 refuted. 0 times theorem prover too weak. 10105 trivial. 0 not checked. [2022-04-08 03:36:29,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:36:30,790 INFO L290 TraceCheckUtils]: 355: Hoare triple {44427#false} assume !false; {44427#false} is VALID [2022-04-08 03:36:30,790 INFO L290 TraceCheckUtils]: 354: Hoare triple {44427#false} assume 0 == ~cond; {44427#false} is VALID [2022-04-08 03:36:30,790 INFO L290 TraceCheckUtils]: 353: Hoare triple {44427#false} ~cond := #in~cond; {44427#false} is VALID [2022-04-08 03:36:30,790 INFO L272 TraceCheckUtils]: 352: Hoare triple {44427#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {44427#false} is VALID [2022-04-08 03:36:30,790 INFO L290 TraceCheckUtils]: 351: Hoare triple {44427#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44427#false} is VALID [2022-04-08 03:36:30,790 INFO L290 TraceCheckUtils]: 350: Hoare triple {44427#false} ~i~0 := 0; {44427#false} is VALID [2022-04-08 03:36:30,791 INFO L290 TraceCheckUtils]: 349: Hoare triple {45548#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {44427#false} is VALID [2022-04-08 03:36:30,791 INFO L290 TraceCheckUtils]: 348: Hoare triple {45552#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {45548#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,791 INFO L290 TraceCheckUtils]: 347: Hoare triple {45552#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {45552#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:30,791 INFO L290 TraceCheckUtils]: 346: Hoare triple {45552#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {45552#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:30,792 INFO L290 TraceCheckUtils]: 345: Hoare triple {45562#(< (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {45552#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:30,792 INFO L290 TraceCheckUtils]: 344: Hoare triple {45562#(< (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {45562#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:36:30,792 INFO L290 TraceCheckUtils]: 343: Hoare triple {45562#(< (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {45562#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:36:30,793 INFO L290 TraceCheckUtils]: 342: Hoare triple {45572#(< (+ main_~i~0 3) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {45562#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:36:30,793 INFO L290 TraceCheckUtils]: 341: Hoare triple {45572#(< (+ main_~i~0 3) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {45572#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:36:30,793 INFO L290 TraceCheckUtils]: 340: Hoare triple {45572#(< (+ main_~i~0 3) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {45572#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:36:30,793 INFO L290 TraceCheckUtils]: 339: Hoare triple {45582#(< 3 main_~edgecount~0)} ~i~0 := 0; {45572#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:36:30,794 INFO L290 TraceCheckUtils]: 338: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,794 INFO L290 TraceCheckUtils]: 337: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,794 INFO L290 TraceCheckUtils]: 336: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,794 INFO L290 TraceCheckUtils]: 335: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,795 INFO L290 TraceCheckUtils]: 334: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,795 INFO L290 TraceCheckUtils]: 333: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,795 INFO L290 TraceCheckUtils]: 332: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,795 INFO L290 TraceCheckUtils]: 331: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,796 INFO L290 TraceCheckUtils]: 330: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,796 INFO L290 TraceCheckUtils]: 329: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,796 INFO L290 TraceCheckUtils]: 328: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,796 INFO L290 TraceCheckUtils]: 327: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,797 INFO L290 TraceCheckUtils]: 326: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,797 INFO L290 TraceCheckUtils]: 325: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,797 INFO L290 TraceCheckUtils]: 324: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,797 INFO L290 TraceCheckUtils]: 323: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,798 INFO L290 TraceCheckUtils]: 322: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,798 INFO L290 TraceCheckUtils]: 321: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,798 INFO L290 TraceCheckUtils]: 320: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,798 INFO L290 TraceCheckUtils]: 319: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,799 INFO L290 TraceCheckUtils]: 318: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,799 INFO L290 TraceCheckUtils]: 317: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,799 INFO L290 TraceCheckUtils]: 316: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,799 INFO L290 TraceCheckUtils]: 315: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,800 INFO L290 TraceCheckUtils]: 314: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,800 INFO L290 TraceCheckUtils]: 313: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,800 INFO L290 TraceCheckUtils]: 312: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,800 INFO L290 TraceCheckUtils]: 311: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,801 INFO L290 TraceCheckUtils]: 310: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,801 INFO L290 TraceCheckUtils]: 309: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,801 INFO L290 TraceCheckUtils]: 308: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,801 INFO L290 TraceCheckUtils]: 307: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,801 INFO L290 TraceCheckUtils]: 306: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,802 INFO L290 TraceCheckUtils]: 305: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,802 INFO L290 TraceCheckUtils]: 304: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,802 INFO L290 TraceCheckUtils]: 303: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,802 INFO L290 TraceCheckUtils]: 302: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,803 INFO L290 TraceCheckUtils]: 301: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,803 INFO L290 TraceCheckUtils]: 300: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,803 INFO L290 TraceCheckUtils]: 299: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,803 INFO L290 TraceCheckUtils]: 298: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,804 INFO L290 TraceCheckUtils]: 297: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,804 INFO L290 TraceCheckUtils]: 296: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,804 INFO L290 TraceCheckUtils]: 295: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,804 INFO L290 TraceCheckUtils]: 294: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,805 INFO L290 TraceCheckUtils]: 293: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,805 INFO L290 TraceCheckUtils]: 292: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,805 INFO L290 TraceCheckUtils]: 291: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,805 INFO L290 TraceCheckUtils]: 290: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,806 INFO L290 TraceCheckUtils]: 289: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,806 INFO L290 TraceCheckUtils]: 288: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,806 INFO L290 TraceCheckUtils]: 287: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,806 INFO L290 TraceCheckUtils]: 286: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,807 INFO L290 TraceCheckUtils]: 285: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,807 INFO L290 TraceCheckUtils]: 284: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,807 INFO L290 TraceCheckUtils]: 283: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,807 INFO L290 TraceCheckUtils]: 282: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,807 INFO L290 TraceCheckUtils]: 281: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,808 INFO L290 TraceCheckUtils]: 280: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,808 INFO L290 TraceCheckUtils]: 279: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,808 INFO L290 TraceCheckUtils]: 278: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,808 INFO L290 TraceCheckUtils]: 277: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,809 INFO L290 TraceCheckUtils]: 276: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,809 INFO L290 TraceCheckUtils]: 275: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,809 INFO L290 TraceCheckUtils]: 274: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,809 INFO L290 TraceCheckUtils]: 273: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,810 INFO L290 TraceCheckUtils]: 272: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,810 INFO L290 TraceCheckUtils]: 271: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,810 INFO L290 TraceCheckUtils]: 270: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,810 INFO L290 TraceCheckUtils]: 269: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,811 INFO L290 TraceCheckUtils]: 268: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,811 INFO L290 TraceCheckUtils]: 267: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,811 INFO L290 TraceCheckUtils]: 266: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,811 INFO L290 TraceCheckUtils]: 265: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,812 INFO L290 TraceCheckUtils]: 264: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,812 INFO L290 TraceCheckUtils]: 263: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,812 INFO L290 TraceCheckUtils]: 262: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,812 INFO L290 TraceCheckUtils]: 261: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,813 INFO L290 TraceCheckUtils]: 260: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,813 INFO L290 TraceCheckUtils]: 259: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,813 INFO L290 TraceCheckUtils]: 258: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,813 INFO L290 TraceCheckUtils]: 257: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,813 INFO L290 TraceCheckUtils]: 256: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,814 INFO L290 TraceCheckUtils]: 255: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,814 INFO L290 TraceCheckUtils]: 254: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,814 INFO L290 TraceCheckUtils]: 253: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,814 INFO L290 TraceCheckUtils]: 252: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,815 INFO L290 TraceCheckUtils]: 251: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,815 INFO L290 TraceCheckUtils]: 250: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,815 INFO L290 TraceCheckUtils]: 249: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,815 INFO L290 TraceCheckUtils]: 248: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,816 INFO L290 TraceCheckUtils]: 247: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,816 INFO L290 TraceCheckUtils]: 246: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,816 INFO L290 TraceCheckUtils]: 245: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,816 INFO L290 TraceCheckUtils]: 244: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,817 INFO L290 TraceCheckUtils]: 243: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,817 INFO L290 TraceCheckUtils]: 242: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,817 INFO L290 TraceCheckUtils]: 241: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,817 INFO L290 TraceCheckUtils]: 240: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,818 INFO L290 TraceCheckUtils]: 239: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,818 INFO L290 TraceCheckUtils]: 238: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,818 INFO L290 TraceCheckUtils]: 237: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,818 INFO L290 TraceCheckUtils]: 236: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,819 INFO L290 TraceCheckUtils]: 235: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,819 INFO L290 TraceCheckUtils]: 234: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,819 INFO L290 TraceCheckUtils]: 233: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,819 INFO L290 TraceCheckUtils]: 232: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,820 INFO L290 TraceCheckUtils]: 231: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,820 INFO L290 TraceCheckUtils]: 230: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,820 INFO L290 TraceCheckUtils]: 229: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,820 INFO L290 TraceCheckUtils]: 228: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,820 INFO L290 TraceCheckUtils]: 227: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,821 INFO L290 TraceCheckUtils]: 226: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,821 INFO L290 TraceCheckUtils]: 225: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,821 INFO L290 TraceCheckUtils]: 224: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,821 INFO L290 TraceCheckUtils]: 223: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,822 INFO L290 TraceCheckUtils]: 222: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,822 INFO L290 TraceCheckUtils]: 221: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,822 INFO L290 TraceCheckUtils]: 220: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,822 INFO L290 TraceCheckUtils]: 219: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,823 INFO L290 TraceCheckUtils]: 218: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,823 INFO L290 TraceCheckUtils]: 217: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,823 INFO L290 TraceCheckUtils]: 216: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,823 INFO L290 TraceCheckUtils]: 215: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,824 INFO L290 TraceCheckUtils]: 214: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,824 INFO L290 TraceCheckUtils]: 213: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,824 INFO L290 TraceCheckUtils]: 212: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,824 INFO L290 TraceCheckUtils]: 211: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,825 INFO L290 TraceCheckUtils]: 210: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,825 INFO L290 TraceCheckUtils]: 209: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,825 INFO L290 TraceCheckUtils]: 208: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,825 INFO L290 TraceCheckUtils]: 207: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,826 INFO L290 TraceCheckUtils]: 206: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,826 INFO L290 TraceCheckUtils]: 205: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,826 INFO L290 TraceCheckUtils]: 204: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,826 INFO L290 TraceCheckUtils]: 203: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,827 INFO L290 TraceCheckUtils]: 202: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,827 INFO L290 TraceCheckUtils]: 201: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,827 INFO L290 TraceCheckUtils]: 200: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,827 INFO L290 TraceCheckUtils]: 199: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,827 INFO L290 TraceCheckUtils]: 198: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,828 INFO L290 TraceCheckUtils]: 197: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,828 INFO L290 TraceCheckUtils]: 196: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,828 INFO L290 TraceCheckUtils]: 195: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,828 INFO L290 TraceCheckUtils]: 194: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,829 INFO L290 TraceCheckUtils]: 193: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,829 INFO L290 TraceCheckUtils]: 192: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,829 INFO L290 TraceCheckUtils]: 191: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,829 INFO L290 TraceCheckUtils]: 190: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,830 INFO L290 TraceCheckUtils]: 189: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,830 INFO L290 TraceCheckUtils]: 188: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,830 INFO L290 TraceCheckUtils]: 187: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,830 INFO L290 TraceCheckUtils]: 186: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,831 INFO L290 TraceCheckUtils]: 185: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,831 INFO L290 TraceCheckUtils]: 184: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,831 INFO L290 TraceCheckUtils]: 183: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,831 INFO L290 TraceCheckUtils]: 182: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,832 INFO L290 TraceCheckUtils]: 181: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,832 INFO L290 TraceCheckUtils]: 180: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,832 INFO L290 TraceCheckUtils]: 179: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,832 INFO L290 TraceCheckUtils]: 178: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,832 INFO L290 TraceCheckUtils]: 177: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,833 INFO L290 TraceCheckUtils]: 176: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,833 INFO L290 TraceCheckUtils]: 175: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,833 INFO L290 TraceCheckUtils]: 174: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,833 INFO L290 TraceCheckUtils]: 173: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,834 INFO L290 TraceCheckUtils]: 172: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,834 INFO L290 TraceCheckUtils]: 171: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,834 INFO L290 TraceCheckUtils]: 170: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,834 INFO L290 TraceCheckUtils]: 169: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,835 INFO L290 TraceCheckUtils]: 168: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,835 INFO L290 TraceCheckUtils]: 167: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,835 INFO L290 TraceCheckUtils]: 166: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,835 INFO L290 TraceCheckUtils]: 165: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,836 INFO L290 TraceCheckUtils]: 164: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,836 INFO L290 TraceCheckUtils]: 163: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,836 INFO L290 TraceCheckUtils]: 162: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,836 INFO L290 TraceCheckUtils]: 161: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,837 INFO L290 TraceCheckUtils]: 160: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,837 INFO L290 TraceCheckUtils]: 159: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,837 INFO L290 TraceCheckUtils]: 158: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,837 INFO L290 TraceCheckUtils]: 157: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,837 INFO L290 TraceCheckUtils]: 156: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,838 INFO L290 TraceCheckUtils]: 155: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,838 INFO L290 TraceCheckUtils]: 154: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,838 INFO L290 TraceCheckUtils]: 153: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,838 INFO L290 TraceCheckUtils]: 152: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,839 INFO L290 TraceCheckUtils]: 151: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,839 INFO L290 TraceCheckUtils]: 150: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,839 INFO L290 TraceCheckUtils]: 149: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,839 INFO L290 TraceCheckUtils]: 148: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,840 INFO L290 TraceCheckUtils]: 147: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,840 INFO L290 TraceCheckUtils]: 146: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,840 INFO L290 TraceCheckUtils]: 145: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,840 INFO L290 TraceCheckUtils]: 144: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,841 INFO L290 TraceCheckUtils]: 143: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,841 INFO L290 TraceCheckUtils]: 142: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,841 INFO L290 TraceCheckUtils]: 141: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,841 INFO L290 TraceCheckUtils]: 140: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,842 INFO L290 TraceCheckUtils]: 139: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,842 INFO L290 TraceCheckUtils]: 138: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,842 INFO L290 TraceCheckUtils]: 137: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,842 INFO L290 TraceCheckUtils]: 136: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,843 INFO L290 TraceCheckUtils]: 135: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,843 INFO L290 TraceCheckUtils]: 134: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,843 INFO L290 TraceCheckUtils]: 133: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,843 INFO L290 TraceCheckUtils]: 132: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,844 INFO L290 TraceCheckUtils]: 131: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,844 INFO L290 TraceCheckUtils]: 130: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,844 INFO L290 TraceCheckUtils]: 129: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,844 INFO L290 TraceCheckUtils]: 128: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,845 INFO L290 TraceCheckUtils]: 127: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,845 INFO L290 TraceCheckUtils]: 126: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,845 INFO L290 TraceCheckUtils]: 125: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,845 INFO L290 TraceCheckUtils]: 124: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,845 INFO L290 TraceCheckUtils]: 123: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,846 INFO L290 TraceCheckUtils]: 122: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,846 INFO L290 TraceCheckUtils]: 121: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,846 INFO L290 TraceCheckUtils]: 120: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,846 INFO L290 TraceCheckUtils]: 119: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,847 INFO L290 TraceCheckUtils]: 118: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,847 INFO L290 TraceCheckUtils]: 117: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,847 INFO L290 TraceCheckUtils]: 116: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,847 INFO L290 TraceCheckUtils]: 115: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,848 INFO L290 TraceCheckUtils]: 114: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,848 INFO L290 TraceCheckUtils]: 113: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,848 INFO L290 TraceCheckUtils]: 112: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,848 INFO L290 TraceCheckUtils]: 111: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,849 INFO L290 TraceCheckUtils]: 110: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,849 INFO L290 TraceCheckUtils]: 109: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,849 INFO L290 TraceCheckUtils]: 108: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,849 INFO L290 TraceCheckUtils]: 107: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,850 INFO L290 TraceCheckUtils]: 106: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,850 INFO L290 TraceCheckUtils]: 105: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,850 INFO L290 TraceCheckUtils]: 104: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,850 INFO L290 TraceCheckUtils]: 103: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,850 INFO L290 TraceCheckUtils]: 102: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,851 INFO L290 TraceCheckUtils]: 101: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,851 INFO L290 TraceCheckUtils]: 100: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,851 INFO L290 TraceCheckUtils]: 99: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,851 INFO L290 TraceCheckUtils]: 98: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,852 INFO L290 TraceCheckUtils]: 97: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,852 INFO L290 TraceCheckUtils]: 96: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,852 INFO L290 TraceCheckUtils]: 95: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,852 INFO L290 TraceCheckUtils]: 94: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,853 INFO L290 TraceCheckUtils]: 93: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,853 INFO L290 TraceCheckUtils]: 92: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,853 INFO L290 TraceCheckUtils]: 91: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,853 INFO L290 TraceCheckUtils]: 90: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,854 INFO L290 TraceCheckUtils]: 89: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,854 INFO L290 TraceCheckUtils]: 88: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,854 INFO L290 TraceCheckUtils]: 87: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,854 INFO L290 TraceCheckUtils]: 86: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,855 INFO L290 TraceCheckUtils]: 85: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,855 INFO L290 TraceCheckUtils]: 84: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,855 INFO L290 TraceCheckUtils]: 83: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,855 INFO L290 TraceCheckUtils]: 82: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,856 INFO L290 TraceCheckUtils]: 81: Hoare triple {44539#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-08 03:36:30,856 INFO L290 TraceCheckUtils]: 80: Hoare triple {44529#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44539#(<= 3 main_~j~0)} is VALID [2022-04-08 03:36:30,857 INFO L290 TraceCheckUtils]: 79: Hoare triple {44529#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44529#(<= 2 main_~j~0)} is VALID [2022-04-08 03:36:30,857 INFO L290 TraceCheckUtils]: 78: Hoare triple {44529#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44529#(<= 2 main_~j~0)} is VALID [2022-04-08 03:36:30,857 INFO L290 TraceCheckUtils]: 77: Hoare triple {44519#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44529#(<= 2 main_~j~0)} is VALID [2022-04-08 03:36:30,857 INFO L290 TraceCheckUtils]: 76: Hoare triple {44519#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44519#(<= 1 main_~j~0)} is VALID [2022-04-08 03:36:30,858 INFO L290 TraceCheckUtils]: 75: Hoare triple {44519#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44519#(<= 1 main_~j~0)} is VALID [2022-04-08 03:36:30,858 INFO L290 TraceCheckUtils]: 74: Hoare triple {44509#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44519#(<= 1 main_~j~0)} is VALID [2022-04-08 03:36:30,858 INFO L290 TraceCheckUtils]: 73: Hoare triple {44509#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44509#(<= 0 main_~j~0)} is VALID [2022-04-08 03:36:30,858 INFO L290 TraceCheckUtils]: 72: Hoare triple {44509#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44509#(<= 0 main_~j~0)} is VALID [2022-04-08 03:36:30,859 INFO L290 TraceCheckUtils]: 71: Hoare triple {46387#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44509#(<= 0 main_~j~0)} is VALID [2022-04-08 03:36:30,859 INFO L290 TraceCheckUtils]: 70: Hoare triple {46387#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46387#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:36:30,859 INFO L290 TraceCheckUtils]: 69: Hoare triple {46387#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46387#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:36:30,860 INFO L290 TraceCheckUtils]: 68: Hoare triple {46397#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46387#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:36:30,860 INFO L290 TraceCheckUtils]: 67: Hoare triple {46397#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46397#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:36:30,860 INFO L290 TraceCheckUtils]: 66: Hoare triple {46397#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46397#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:36:30,861 INFO L290 TraceCheckUtils]: 65: Hoare triple {46407#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46397#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:36:30,861 INFO L290 TraceCheckUtils]: 64: Hoare triple {46407#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46407#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:36:30,861 INFO L290 TraceCheckUtils]: 63: Hoare triple {46407#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46407#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:36:30,862 INFO L290 TraceCheckUtils]: 62: Hoare triple {46417#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46407#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:36:30,862 INFO L290 TraceCheckUtils]: 61: Hoare triple {46417#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46417#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:36:30,862 INFO L290 TraceCheckUtils]: 60: Hoare triple {46417#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46417#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:36:30,863 INFO L290 TraceCheckUtils]: 59: Hoare triple {46427#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46417#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:36:30,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {46427#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46427#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:36:30,863 INFO L290 TraceCheckUtils]: 57: Hoare triple {46427#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46427#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:36:30,863 INFO L290 TraceCheckUtils]: 56: Hoare triple {46437#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46427#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:36:30,864 INFO L290 TraceCheckUtils]: 55: Hoare triple {46437#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46437#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:36:30,864 INFO L290 TraceCheckUtils]: 54: Hoare triple {46437#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46437#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:36:30,865 INFO L290 TraceCheckUtils]: 53: Hoare triple {46447#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46437#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:36:30,865 INFO L290 TraceCheckUtils]: 52: Hoare triple {46447#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46447#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:36:30,865 INFO L290 TraceCheckUtils]: 51: Hoare triple {46447#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46447#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:36:30,865 INFO L290 TraceCheckUtils]: 50: Hoare triple {46457#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46447#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:36:30,866 INFO L290 TraceCheckUtils]: 49: Hoare triple {46457#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46457#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:36:30,866 INFO L290 TraceCheckUtils]: 48: Hoare triple {46457#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46457#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:36:30,866 INFO L290 TraceCheckUtils]: 47: Hoare triple {46467#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46457#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:36:30,867 INFO L290 TraceCheckUtils]: 46: Hoare triple {46467#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46467#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:36:30,867 INFO L290 TraceCheckUtils]: 45: Hoare triple {46467#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46467#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:36:30,867 INFO L290 TraceCheckUtils]: 44: Hoare triple {46477#(<= 0 (+ main_~j~0 10))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46467#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:36:30,868 INFO L290 TraceCheckUtils]: 43: Hoare triple {46477#(<= 0 (+ main_~j~0 10))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46477#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 03:36:30,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {46477#(<= 0 (+ main_~j~0 10))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46477#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 03:36:30,868 INFO L290 TraceCheckUtils]: 41: Hoare triple {46487#(<= 0 (+ main_~j~0 11))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46477#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 03:36:30,868 INFO L290 TraceCheckUtils]: 40: Hoare triple {46487#(<= 0 (+ main_~j~0 11))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46487#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 03:36:30,869 INFO L290 TraceCheckUtils]: 39: Hoare triple {46487#(<= 0 (+ main_~j~0 11))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46487#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 03:36:30,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {46497#(<= 0 (+ main_~j~0 12))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46487#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 03:36:30,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {46497#(<= 0 (+ main_~j~0 12))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46497#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 03:36:30,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {46497#(<= 0 (+ main_~j~0 12))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46497#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 03:36:30,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {46507#(<= 0 (+ main_~j~0 13))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46497#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 03:36:30,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {46507#(<= 0 (+ main_~j~0 13))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46507#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 03:36:30,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {46507#(<= 0 (+ main_~j~0 13))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46507#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 03:36:30,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {46517#(<= 0 (+ main_~j~0 14))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46507#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 03:36:30,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {46517#(<= 0 (+ main_~j~0 14))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46517#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 03:36:30,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {46517#(<= 0 (+ main_~j~0 14))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46517#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 03:36:30,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {46527#(<= 0 (+ main_~j~0 15))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46517#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-08 03:36:30,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {46527#(<= 0 (+ main_~j~0 15))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46527#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 03:36:30,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {46527#(<= 0 (+ main_~j~0 15))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46527#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 03:36:30,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {46537#(<= 0 (+ main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46527#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-08 03:36:30,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {46537#(<= 0 (+ main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46537#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-08 03:36:30,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {46537#(<= 0 (+ main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46537#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-08 03:36:30,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {46537#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-08 03:36:30,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {44426#true} ~i~0 := 0; {44426#true} is VALID [2022-04-08 03:36:30,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {44426#true} assume !(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 03:36:30,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 03:36:30,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 03:36:30,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 03:36:30,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 03:36:30,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 03:36:30,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 03:36:30,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 03:36:30,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 03:36:30,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 03:36:30,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 03:36:30,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 03:36:30,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 03:36:30,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-08 03:36:30,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {44426#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-08 03:36:30,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-08 03:36:30,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {44426#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {44426#true} is VALID [2022-04-08 03:36:30,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {44426#true} call #t~ret22 := main(); {44426#true} is VALID [2022-04-08 03:36:30,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44426#true} {44426#true} #107#return; {44426#true} is VALID [2022-04-08 03:36:30,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {44426#true} assume true; {44426#true} is VALID [2022-04-08 03:36:30,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {44426#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {44426#true} is VALID [2022-04-08 03:36:30,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {44426#true} call ULTIMATE.init(); {44426#true} is VALID [2022-04-08 03:36:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 15432 backedges. 537 proven. 4790 refuted. 0 times theorem prover too weak. 10105 trivial. 0 not checked. [2022-04-08 03:36:30,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694706265] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:36:30,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:36:30,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 27, 27] total 54 [2022-04-08 03:36:30,876 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:36:30,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [126050551] [2022-04-08 03:36:30,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [126050551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:36:30,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:36:30,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:36:30,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562417089] [2022-04-08 03:36:30,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:36:30,877 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 356 [2022-04-08 03:36:30,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:36:30,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:30,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:30,907 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:36:30,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:30,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:36:30,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2044, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 03:36:30,908 INFO L87 Difference]: Start difference. First operand 361 states and 470 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:32,748 INFO L93 Difference]: Finished difference Result 393 states and 507 transitions. [2022-04-08 03:36:32,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:36:32,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 356 [2022-04-08 03:36:32,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:36:32,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:32,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2022-04-08 03:36:32,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2022-04-08 03:36:32,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 120 transitions. [2022-04-08 03:36:32,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:32,841 INFO L225 Difference]: With dead ends: 393 [2022-04-08 03:36:32,841 INFO L226 Difference]: Without dead ends: 382 [2022-04-08 03:36:32,841 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=894, Invalid=2528, Unknown=0, NotChecked=0, Total=3422 [2022-04-08 03:36:32,842 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 166 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:36:32,842 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 34 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:36:32,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-04-08 03:36:34,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 364. [2022-04-08 03:36:34,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:36:34,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 382 states. Second operand has 364 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 358 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:34,317 INFO L74 IsIncluded]: Start isIncluded. First operand 382 states. Second operand has 364 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 358 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:34,318 INFO L87 Difference]: Start difference. First operand 382 states. Second operand has 364 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 358 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:34,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:34,323 INFO L93 Difference]: Finished difference Result 382 states and 495 transitions. [2022-04-08 03:36:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 495 transitions. [2022-04-08 03:36:34,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:34,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:34,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 358 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 382 states. [2022-04-08 03:36:34,324 INFO L87 Difference]: Start difference. First operand has 364 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 358 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 382 states. [2022-04-08 03:36:34,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:34,329 INFO L93 Difference]: Finished difference Result 382 states and 495 transitions. [2022-04-08 03:36:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 495 transitions. [2022-04-08 03:36:34,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:34,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:34,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:36:34,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:36:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 358 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:34,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 473 transitions. [2022-04-08 03:36:34,335 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 473 transitions. Word has length 356 [2022-04-08 03:36:34,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:36:34,336 INFO L478 AbstractCegarLoop]: Abstraction has 364 states and 473 transitions. [2022-04-08 03:36:34,336 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:34,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 473 transitions. [2022-04-08 03:36:35,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 473 transitions. [2022-04-08 03:36:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2022-04-08 03:36:35,078 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:36:35,078 INFO L499 BasicCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:36:35,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-08 03:36:35,278 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-08 03:36:35,279 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:36:35,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:36:35,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1962575558, now seen corresponding path program 59 times [2022-04-08 03:36:35,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:35,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1077873977] [2022-04-08 03:36:35,282 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:36:35,282 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:36:35,283 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:36:35,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1962575558, now seen corresponding path program 60 times [2022-04-08 03:36:35,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:36:35,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108379328] [2022-04-08 03:36:35,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:36:35,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:36:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:35,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:36:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:35,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {48917#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {48906#true} is VALID [2022-04-08 03:36:35,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {48906#true} assume true; {48906#true} is VALID [2022-04-08 03:36:35,579 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48906#true} {48906#true} #107#return; {48906#true} is VALID [2022-04-08 03:36:35,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {48906#true} call ULTIMATE.init(); {48917#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:36:35,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {48917#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {48906#true} is VALID [2022-04-08 03:36:35,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {48906#true} assume true; {48906#true} is VALID [2022-04-08 03:36:35,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48906#true} {48906#true} #107#return; {48906#true} is VALID [2022-04-08 03:36:35,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {48906#true} call #t~ret22 := main(); {48906#true} is VALID [2022-04-08 03:36:35,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {48906#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {48911#(<= 20 main_~edgecount~0)} ~i~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,587 INFO L290 TraceCheckUtils]: 32: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,588 INFO L290 TraceCheckUtils]: 34: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,588 INFO L290 TraceCheckUtils]: 36: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,588 INFO L290 TraceCheckUtils]: 37: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,589 INFO L290 TraceCheckUtils]: 38: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,589 INFO L290 TraceCheckUtils]: 39: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,589 INFO L290 TraceCheckUtils]: 40: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,589 INFO L290 TraceCheckUtils]: 41: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,590 INFO L290 TraceCheckUtils]: 42: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,590 INFO L290 TraceCheckUtils]: 43: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,590 INFO L290 TraceCheckUtils]: 44: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,591 INFO L290 TraceCheckUtils]: 47: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,591 INFO L290 TraceCheckUtils]: 48: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,591 INFO L290 TraceCheckUtils]: 50: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,592 INFO L290 TraceCheckUtils]: 51: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,592 INFO L290 TraceCheckUtils]: 52: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,592 INFO L290 TraceCheckUtils]: 53: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,592 INFO L290 TraceCheckUtils]: 54: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,592 INFO L290 TraceCheckUtils]: 55: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,593 INFO L290 TraceCheckUtils]: 56: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,593 INFO L290 TraceCheckUtils]: 57: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,593 INFO L290 TraceCheckUtils]: 58: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,593 INFO L290 TraceCheckUtils]: 59: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,593 INFO L290 TraceCheckUtils]: 60: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,594 INFO L290 TraceCheckUtils]: 61: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,594 INFO L290 TraceCheckUtils]: 62: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,594 INFO L290 TraceCheckUtils]: 63: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,594 INFO L290 TraceCheckUtils]: 64: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,594 INFO L290 TraceCheckUtils]: 65: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,595 INFO L290 TraceCheckUtils]: 66: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,595 INFO L290 TraceCheckUtils]: 67: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,595 INFO L290 TraceCheckUtils]: 68: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,595 INFO L290 TraceCheckUtils]: 69: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,596 INFO L290 TraceCheckUtils]: 70: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,596 INFO L290 TraceCheckUtils]: 71: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,596 INFO L290 TraceCheckUtils]: 72: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,596 INFO L290 TraceCheckUtils]: 73: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,596 INFO L290 TraceCheckUtils]: 74: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,597 INFO L290 TraceCheckUtils]: 75: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,597 INFO L290 TraceCheckUtils]: 76: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,597 INFO L290 TraceCheckUtils]: 77: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,597 INFO L290 TraceCheckUtils]: 78: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,597 INFO L290 TraceCheckUtils]: 79: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,598 INFO L290 TraceCheckUtils]: 80: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,598 INFO L290 TraceCheckUtils]: 81: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,598 INFO L290 TraceCheckUtils]: 82: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,598 INFO L290 TraceCheckUtils]: 83: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,598 INFO L290 TraceCheckUtils]: 84: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,599 INFO L290 TraceCheckUtils]: 85: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,599 INFO L290 TraceCheckUtils]: 86: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,599 INFO L290 TraceCheckUtils]: 87: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,599 INFO L290 TraceCheckUtils]: 88: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,599 INFO L290 TraceCheckUtils]: 89: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,600 INFO L290 TraceCheckUtils]: 90: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,600 INFO L290 TraceCheckUtils]: 91: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,600 INFO L290 TraceCheckUtils]: 92: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,600 INFO L290 TraceCheckUtils]: 93: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,600 INFO L290 TraceCheckUtils]: 94: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,601 INFO L290 TraceCheckUtils]: 95: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,601 INFO L290 TraceCheckUtils]: 96: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,601 INFO L290 TraceCheckUtils]: 97: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,601 INFO L290 TraceCheckUtils]: 98: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,602 INFO L290 TraceCheckUtils]: 99: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,602 INFO L290 TraceCheckUtils]: 100: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,602 INFO L290 TraceCheckUtils]: 101: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,602 INFO L290 TraceCheckUtils]: 102: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,602 INFO L290 TraceCheckUtils]: 103: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,603 INFO L290 TraceCheckUtils]: 104: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,603 INFO L290 TraceCheckUtils]: 105: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,603 INFO L290 TraceCheckUtils]: 106: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,603 INFO L290 TraceCheckUtils]: 107: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,603 INFO L290 TraceCheckUtils]: 108: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,604 INFO L290 TraceCheckUtils]: 109: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,604 INFO L290 TraceCheckUtils]: 110: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,604 INFO L290 TraceCheckUtils]: 111: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,604 INFO L290 TraceCheckUtils]: 112: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,604 INFO L290 TraceCheckUtils]: 113: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,605 INFO L290 TraceCheckUtils]: 114: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,605 INFO L290 TraceCheckUtils]: 115: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,605 INFO L290 TraceCheckUtils]: 116: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,605 INFO L290 TraceCheckUtils]: 117: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,605 INFO L290 TraceCheckUtils]: 118: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,606 INFO L290 TraceCheckUtils]: 119: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,606 INFO L290 TraceCheckUtils]: 120: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,606 INFO L290 TraceCheckUtils]: 121: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,606 INFO L290 TraceCheckUtils]: 122: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,607 INFO L290 TraceCheckUtils]: 123: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,607 INFO L290 TraceCheckUtils]: 124: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,607 INFO L290 TraceCheckUtils]: 125: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,607 INFO L290 TraceCheckUtils]: 126: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,607 INFO L290 TraceCheckUtils]: 127: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,608 INFO L290 TraceCheckUtils]: 128: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,608 INFO L290 TraceCheckUtils]: 129: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,608 INFO L290 TraceCheckUtils]: 130: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,608 INFO L290 TraceCheckUtils]: 131: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,608 INFO L290 TraceCheckUtils]: 132: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,609 INFO L290 TraceCheckUtils]: 133: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,609 INFO L290 TraceCheckUtils]: 134: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,609 INFO L290 TraceCheckUtils]: 135: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,609 INFO L290 TraceCheckUtils]: 136: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,609 INFO L290 TraceCheckUtils]: 137: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,610 INFO L290 TraceCheckUtils]: 138: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,610 INFO L290 TraceCheckUtils]: 139: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,610 INFO L290 TraceCheckUtils]: 140: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,610 INFO L290 TraceCheckUtils]: 141: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,610 INFO L290 TraceCheckUtils]: 142: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,611 INFO L290 TraceCheckUtils]: 143: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,611 INFO L290 TraceCheckUtils]: 144: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,611 INFO L290 TraceCheckUtils]: 145: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,611 INFO L290 TraceCheckUtils]: 146: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,612 INFO L290 TraceCheckUtils]: 147: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,612 INFO L290 TraceCheckUtils]: 148: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,612 INFO L290 TraceCheckUtils]: 149: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,612 INFO L290 TraceCheckUtils]: 150: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,612 INFO L290 TraceCheckUtils]: 151: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,613 INFO L290 TraceCheckUtils]: 152: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,613 INFO L290 TraceCheckUtils]: 153: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,613 INFO L290 TraceCheckUtils]: 154: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,613 INFO L290 TraceCheckUtils]: 155: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,613 INFO L290 TraceCheckUtils]: 156: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,614 INFO L290 TraceCheckUtils]: 157: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,614 INFO L290 TraceCheckUtils]: 158: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,614 INFO L290 TraceCheckUtils]: 159: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,614 INFO L290 TraceCheckUtils]: 160: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,614 INFO L290 TraceCheckUtils]: 161: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,615 INFO L290 TraceCheckUtils]: 162: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,615 INFO L290 TraceCheckUtils]: 163: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,615 INFO L290 TraceCheckUtils]: 164: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,615 INFO L290 TraceCheckUtils]: 165: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,615 INFO L290 TraceCheckUtils]: 166: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,616 INFO L290 TraceCheckUtils]: 167: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,616 INFO L290 TraceCheckUtils]: 168: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,616 INFO L290 TraceCheckUtils]: 169: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,616 INFO L290 TraceCheckUtils]: 170: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,616 INFO L290 TraceCheckUtils]: 171: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,617 INFO L290 TraceCheckUtils]: 172: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,617 INFO L290 TraceCheckUtils]: 173: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,617 INFO L290 TraceCheckUtils]: 174: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,617 INFO L290 TraceCheckUtils]: 175: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,618 INFO L290 TraceCheckUtils]: 176: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,618 INFO L290 TraceCheckUtils]: 177: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,618 INFO L290 TraceCheckUtils]: 178: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,618 INFO L290 TraceCheckUtils]: 179: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,618 INFO L290 TraceCheckUtils]: 180: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,619 INFO L290 TraceCheckUtils]: 181: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,619 INFO L290 TraceCheckUtils]: 182: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,619 INFO L290 TraceCheckUtils]: 183: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,619 INFO L290 TraceCheckUtils]: 184: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,619 INFO L290 TraceCheckUtils]: 185: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,620 INFO L290 TraceCheckUtils]: 186: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,620 INFO L290 TraceCheckUtils]: 187: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,620 INFO L290 TraceCheckUtils]: 188: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,620 INFO L290 TraceCheckUtils]: 189: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,620 INFO L290 TraceCheckUtils]: 190: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,621 INFO L290 TraceCheckUtils]: 191: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,621 INFO L290 TraceCheckUtils]: 192: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,621 INFO L290 TraceCheckUtils]: 193: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,621 INFO L290 TraceCheckUtils]: 194: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,622 INFO L290 TraceCheckUtils]: 195: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,622 INFO L290 TraceCheckUtils]: 196: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,622 INFO L290 TraceCheckUtils]: 197: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,622 INFO L290 TraceCheckUtils]: 198: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,622 INFO L290 TraceCheckUtils]: 199: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,623 INFO L290 TraceCheckUtils]: 200: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,623 INFO L290 TraceCheckUtils]: 201: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,623 INFO L290 TraceCheckUtils]: 202: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,623 INFO L290 TraceCheckUtils]: 203: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,623 INFO L290 TraceCheckUtils]: 204: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,624 INFO L290 TraceCheckUtils]: 205: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,624 INFO L290 TraceCheckUtils]: 206: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,624 INFO L290 TraceCheckUtils]: 207: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,624 INFO L290 TraceCheckUtils]: 208: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,624 INFO L290 TraceCheckUtils]: 209: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,625 INFO L290 TraceCheckUtils]: 210: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,625 INFO L290 TraceCheckUtils]: 211: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,625 INFO L290 TraceCheckUtils]: 212: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,625 INFO L290 TraceCheckUtils]: 213: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,625 INFO L290 TraceCheckUtils]: 214: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,626 INFO L290 TraceCheckUtils]: 215: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,626 INFO L290 TraceCheckUtils]: 216: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,626 INFO L290 TraceCheckUtils]: 217: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,626 INFO L290 TraceCheckUtils]: 218: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,627 INFO L290 TraceCheckUtils]: 219: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,627 INFO L290 TraceCheckUtils]: 220: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,627 INFO L290 TraceCheckUtils]: 221: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,627 INFO L290 TraceCheckUtils]: 222: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,627 INFO L290 TraceCheckUtils]: 223: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,628 INFO L290 TraceCheckUtils]: 224: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,628 INFO L290 TraceCheckUtils]: 225: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,628 INFO L290 TraceCheckUtils]: 226: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,628 INFO L290 TraceCheckUtils]: 227: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,628 INFO L290 TraceCheckUtils]: 228: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,629 INFO L290 TraceCheckUtils]: 229: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,629 INFO L290 TraceCheckUtils]: 230: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,629 INFO L290 TraceCheckUtils]: 231: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,629 INFO L290 TraceCheckUtils]: 232: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,629 INFO L290 TraceCheckUtils]: 233: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,630 INFO L290 TraceCheckUtils]: 234: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,630 INFO L290 TraceCheckUtils]: 235: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,630 INFO L290 TraceCheckUtils]: 236: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,630 INFO L290 TraceCheckUtils]: 237: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,630 INFO L290 TraceCheckUtils]: 238: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,631 INFO L290 TraceCheckUtils]: 239: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,631 INFO L290 TraceCheckUtils]: 240: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,631 INFO L290 TraceCheckUtils]: 241: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,631 INFO L290 TraceCheckUtils]: 242: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,632 INFO L290 TraceCheckUtils]: 243: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,632 INFO L290 TraceCheckUtils]: 244: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,632 INFO L290 TraceCheckUtils]: 245: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,632 INFO L290 TraceCheckUtils]: 246: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,632 INFO L290 TraceCheckUtils]: 247: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,633 INFO L290 TraceCheckUtils]: 248: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,633 INFO L290 TraceCheckUtils]: 249: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,633 INFO L290 TraceCheckUtils]: 250: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,633 INFO L290 TraceCheckUtils]: 251: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,633 INFO L290 TraceCheckUtils]: 252: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,634 INFO L290 TraceCheckUtils]: 253: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,634 INFO L290 TraceCheckUtils]: 254: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,634 INFO L290 TraceCheckUtils]: 255: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,634 INFO L290 TraceCheckUtils]: 256: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,634 INFO L290 TraceCheckUtils]: 257: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,635 INFO L290 TraceCheckUtils]: 258: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,635 INFO L290 TraceCheckUtils]: 259: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,635 INFO L290 TraceCheckUtils]: 260: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,635 INFO L290 TraceCheckUtils]: 261: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,635 INFO L290 TraceCheckUtils]: 262: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,636 INFO L290 TraceCheckUtils]: 263: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,636 INFO L290 TraceCheckUtils]: 264: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,636 INFO L290 TraceCheckUtils]: 265: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,636 INFO L290 TraceCheckUtils]: 266: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,637 INFO L290 TraceCheckUtils]: 267: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,637 INFO L290 TraceCheckUtils]: 268: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,637 INFO L290 TraceCheckUtils]: 269: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,637 INFO L290 TraceCheckUtils]: 270: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,637 INFO L290 TraceCheckUtils]: 271: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,638 INFO L290 TraceCheckUtils]: 272: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,638 INFO L290 TraceCheckUtils]: 273: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,638 INFO L290 TraceCheckUtils]: 274: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,638 INFO L290 TraceCheckUtils]: 275: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,638 INFO L290 TraceCheckUtils]: 276: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,639 INFO L290 TraceCheckUtils]: 277: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,639 INFO L290 TraceCheckUtils]: 278: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,639 INFO L290 TraceCheckUtils]: 279: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,639 INFO L290 TraceCheckUtils]: 280: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,639 INFO L290 TraceCheckUtils]: 281: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,640 INFO L290 TraceCheckUtils]: 282: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,640 INFO L290 TraceCheckUtils]: 283: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,640 INFO L290 TraceCheckUtils]: 284: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,640 INFO L290 TraceCheckUtils]: 285: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,641 INFO L290 TraceCheckUtils]: 286: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,641 INFO L290 TraceCheckUtils]: 287: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,641 INFO L290 TraceCheckUtils]: 288: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,641 INFO L290 TraceCheckUtils]: 289: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,641 INFO L290 TraceCheckUtils]: 290: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,642 INFO L290 TraceCheckUtils]: 291: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,642 INFO L290 TraceCheckUtils]: 292: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,642 INFO L290 TraceCheckUtils]: 293: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,642 INFO L290 TraceCheckUtils]: 294: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,642 INFO L290 TraceCheckUtils]: 295: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,643 INFO L290 TraceCheckUtils]: 296: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,643 INFO L290 TraceCheckUtils]: 297: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,643 INFO L290 TraceCheckUtils]: 298: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,643 INFO L290 TraceCheckUtils]: 299: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,643 INFO L290 TraceCheckUtils]: 300: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,644 INFO L290 TraceCheckUtils]: 301: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,644 INFO L290 TraceCheckUtils]: 302: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,644 INFO L290 TraceCheckUtils]: 303: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,644 INFO L290 TraceCheckUtils]: 304: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,645 INFO L290 TraceCheckUtils]: 305: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,645 INFO L290 TraceCheckUtils]: 306: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,645 INFO L290 TraceCheckUtils]: 307: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,645 INFO L290 TraceCheckUtils]: 308: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,645 INFO L290 TraceCheckUtils]: 309: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,646 INFO L290 TraceCheckUtils]: 310: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,646 INFO L290 TraceCheckUtils]: 311: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,659 INFO L290 TraceCheckUtils]: 312: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,660 INFO L290 TraceCheckUtils]: 313: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,660 INFO L290 TraceCheckUtils]: 314: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,660 INFO L290 TraceCheckUtils]: 315: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,661 INFO L290 TraceCheckUtils]: 316: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,661 INFO L290 TraceCheckUtils]: 317: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,661 INFO L290 TraceCheckUtils]: 318: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,661 INFO L290 TraceCheckUtils]: 319: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,661 INFO L290 TraceCheckUtils]: 320: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,662 INFO L290 TraceCheckUtils]: 321: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,662 INFO L290 TraceCheckUtils]: 322: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,662 INFO L290 TraceCheckUtils]: 323: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,662 INFO L290 TraceCheckUtils]: 324: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,663 INFO L290 TraceCheckUtils]: 325: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,663 INFO L290 TraceCheckUtils]: 326: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,663 INFO L290 TraceCheckUtils]: 327: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,663 INFO L290 TraceCheckUtils]: 328: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,663 INFO L290 TraceCheckUtils]: 329: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,664 INFO L290 TraceCheckUtils]: 330: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,664 INFO L290 TraceCheckUtils]: 331: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,664 INFO L290 TraceCheckUtils]: 332: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,664 INFO L290 TraceCheckUtils]: 333: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,664 INFO L290 TraceCheckUtils]: 334: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,665 INFO L290 TraceCheckUtils]: 335: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,665 INFO L290 TraceCheckUtils]: 336: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,665 INFO L290 TraceCheckUtils]: 337: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,665 INFO L290 TraceCheckUtils]: 338: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:35,666 INFO L290 TraceCheckUtils]: 339: Hoare triple {48911#(<= 20 main_~edgecount~0)} ~i~0 := 0; {48912#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:35,666 INFO L290 TraceCheckUtils]: 340: Hoare triple {48912#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {48912#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:35,666 INFO L290 TraceCheckUtils]: 341: Hoare triple {48912#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {48912#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:35,667 INFO L290 TraceCheckUtils]: 342: Hoare triple {48912#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {48913#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 03:36:35,667 INFO L290 TraceCheckUtils]: 343: Hoare triple {48913#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {48913#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 03:36:35,667 INFO L290 TraceCheckUtils]: 344: Hoare triple {48913#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {48913#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 03:36:35,668 INFO L290 TraceCheckUtils]: 345: Hoare triple {48913#(<= (+ 19 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {48914#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:36:35,668 INFO L290 TraceCheckUtils]: 346: Hoare triple {48914#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {48914#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:36:35,668 INFO L290 TraceCheckUtils]: 347: Hoare triple {48914#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {48914#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:36:35,669 INFO L290 TraceCheckUtils]: 348: Hoare triple {48914#(<= (+ main_~i~0 18) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {48915#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:36:35,669 INFO L290 TraceCheckUtils]: 349: Hoare triple {48915#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {48915#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:36:35,669 INFO L290 TraceCheckUtils]: 350: Hoare triple {48915#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {48915#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:36:35,669 INFO L290 TraceCheckUtils]: 351: Hoare triple {48915#(<= (+ main_~i~0 17) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {48916#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:36:35,670 INFO L290 TraceCheckUtils]: 352: Hoare triple {48916#(<= (+ main_~i~0 16) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {48907#false} is VALID [2022-04-08 03:36:35,670 INFO L290 TraceCheckUtils]: 353: Hoare triple {48907#false} ~i~0 := 0; {48907#false} is VALID [2022-04-08 03:36:35,670 INFO L290 TraceCheckUtils]: 354: Hoare triple {48907#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48907#false} is VALID [2022-04-08 03:36:35,670 INFO L272 TraceCheckUtils]: 355: Hoare triple {48907#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {48907#false} is VALID [2022-04-08 03:36:35,670 INFO L290 TraceCheckUtils]: 356: Hoare triple {48907#false} ~cond := #in~cond; {48907#false} is VALID [2022-04-08 03:36:35,670 INFO L290 TraceCheckUtils]: 357: Hoare triple {48907#false} assume 0 == ~cond; {48907#false} is VALID [2022-04-08 03:36:35,670 INFO L290 TraceCheckUtils]: 358: Hoare triple {48907#false} assume !false; {48907#false} is VALID [2022-04-08 03:36:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15442 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 03:36:35,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:36:35,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108379328] [2022-04-08 03:36:35,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108379328] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:36:35,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852890695] [2022-04-08 03:36:35,671 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:36:35,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:36:35,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:36:35,672 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:36:35,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-08 03:36:37,276 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 03:36:37,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:36:37,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 03:36:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:37,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:36:38,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {48906#true} call ULTIMATE.init(); {48906#true} is VALID [2022-04-08 03:36:38,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {48906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {48906#true} is VALID [2022-04-08 03:36:38,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {48906#true} assume true; {48906#true} is VALID [2022-04-08 03:36:38,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48906#true} {48906#true} #107#return; {48906#true} is VALID [2022-04-08 03:36:38,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {48906#true} call #t~ret22 := main(); {48906#true} is VALID [2022-04-08 03:36:38,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {48906#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {48911#(<= 20 main_~edgecount~0)} ~i~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,551 INFO L290 TraceCheckUtils]: 41: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,551 INFO L290 TraceCheckUtils]: 42: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,551 INFO L290 TraceCheckUtils]: 43: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,552 INFO L290 TraceCheckUtils]: 44: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,552 INFO L290 TraceCheckUtils]: 45: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,552 INFO L290 TraceCheckUtils]: 46: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,552 INFO L290 TraceCheckUtils]: 47: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,553 INFO L290 TraceCheckUtils]: 48: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,553 INFO L290 TraceCheckUtils]: 49: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,553 INFO L290 TraceCheckUtils]: 50: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,553 INFO L290 TraceCheckUtils]: 51: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,554 INFO L290 TraceCheckUtils]: 53: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,554 INFO L290 TraceCheckUtils]: 54: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,554 INFO L290 TraceCheckUtils]: 55: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,555 INFO L290 TraceCheckUtils]: 56: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,555 INFO L290 TraceCheckUtils]: 57: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,555 INFO L290 TraceCheckUtils]: 58: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,555 INFO L290 TraceCheckUtils]: 59: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,556 INFO L290 TraceCheckUtils]: 60: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,556 INFO L290 TraceCheckUtils]: 61: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,556 INFO L290 TraceCheckUtils]: 62: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,556 INFO L290 TraceCheckUtils]: 63: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,556 INFO L290 TraceCheckUtils]: 64: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,557 INFO L290 TraceCheckUtils]: 65: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,557 INFO L290 TraceCheckUtils]: 66: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,557 INFO L290 TraceCheckUtils]: 67: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,557 INFO L290 TraceCheckUtils]: 68: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,558 INFO L290 TraceCheckUtils]: 69: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,558 INFO L290 TraceCheckUtils]: 70: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,558 INFO L290 TraceCheckUtils]: 71: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,558 INFO L290 TraceCheckUtils]: 72: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,559 INFO L290 TraceCheckUtils]: 73: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,559 INFO L290 TraceCheckUtils]: 74: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,559 INFO L290 TraceCheckUtils]: 75: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,559 INFO L290 TraceCheckUtils]: 76: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,560 INFO L290 TraceCheckUtils]: 77: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,560 INFO L290 TraceCheckUtils]: 78: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,560 INFO L290 TraceCheckUtils]: 79: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,560 INFO L290 TraceCheckUtils]: 80: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,561 INFO L290 TraceCheckUtils]: 81: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,561 INFO L290 TraceCheckUtils]: 82: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,561 INFO L290 TraceCheckUtils]: 83: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,561 INFO L290 TraceCheckUtils]: 84: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,561 INFO L290 TraceCheckUtils]: 85: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,562 INFO L290 TraceCheckUtils]: 86: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,562 INFO L290 TraceCheckUtils]: 87: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,562 INFO L290 TraceCheckUtils]: 88: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,562 INFO L290 TraceCheckUtils]: 89: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,563 INFO L290 TraceCheckUtils]: 90: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,563 INFO L290 TraceCheckUtils]: 91: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,563 INFO L290 TraceCheckUtils]: 92: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,563 INFO L290 TraceCheckUtils]: 93: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,564 INFO L290 TraceCheckUtils]: 94: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,564 INFO L290 TraceCheckUtils]: 95: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,564 INFO L290 TraceCheckUtils]: 96: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,564 INFO L290 TraceCheckUtils]: 97: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,564 INFO L290 TraceCheckUtils]: 98: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,565 INFO L290 TraceCheckUtils]: 99: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,565 INFO L290 TraceCheckUtils]: 100: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,565 INFO L290 TraceCheckUtils]: 101: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,566 INFO L290 TraceCheckUtils]: 102: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,566 INFO L290 TraceCheckUtils]: 103: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,566 INFO L290 TraceCheckUtils]: 104: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,566 INFO L290 TraceCheckUtils]: 105: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,566 INFO L290 TraceCheckUtils]: 106: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,567 INFO L290 TraceCheckUtils]: 107: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,567 INFO L290 TraceCheckUtils]: 108: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,567 INFO L290 TraceCheckUtils]: 109: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,567 INFO L290 TraceCheckUtils]: 110: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,568 INFO L290 TraceCheckUtils]: 111: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,568 INFO L290 TraceCheckUtils]: 112: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,568 INFO L290 TraceCheckUtils]: 113: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,568 INFO L290 TraceCheckUtils]: 114: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,569 INFO L290 TraceCheckUtils]: 115: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,569 INFO L290 TraceCheckUtils]: 116: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,569 INFO L290 TraceCheckUtils]: 117: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,569 INFO L290 TraceCheckUtils]: 118: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,570 INFO L290 TraceCheckUtils]: 119: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,570 INFO L290 TraceCheckUtils]: 120: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,570 INFO L290 TraceCheckUtils]: 121: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,570 INFO L290 TraceCheckUtils]: 122: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,571 INFO L290 TraceCheckUtils]: 123: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,571 INFO L290 TraceCheckUtils]: 124: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,571 INFO L290 TraceCheckUtils]: 125: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,571 INFO L290 TraceCheckUtils]: 126: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,572 INFO L290 TraceCheckUtils]: 127: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,572 INFO L290 TraceCheckUtils]: 128: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,572 INFO L290 TraceCheckUtils]: 129: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,572 INFO L290 TraceCheckUtils]: 130: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,572 INFO L290 TraceCheckUtils]: 131: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,573 INFO L290 TraceCheckUtils]: 132: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,573 INFO L290 TraceCheckUtils]: 133: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,573 INFO L290 TraceCheckUtils]: 134: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,573 INFO L290 TraceCheckUtils]: 135: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,574 INFO L290 TraceCheckUtils]: 136: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,574 INFO L290 TraceCheckUtils]: 137: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,574 INFO L290 TraceCheckUtils]: 138: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,574 INFO L290 TraceCheckUtils]: 139: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,575 INFO L290 TraceCheckUtils]: 140: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,575 INFO L290 TraceCheckUtils]: 141: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,575 INFO L290 TraceCheckUtils]: 142: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,575 INFO L290 TraceCheckUtils]: 143: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,576 INFO L290 TraceCheckUtils]: 144: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,576 INFO L290 TraceCheckUtils]: 145: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,576 INFO L290 TraceCheckUtils]: 146: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,576 INFO L290 TraceCheckUtils]: 147: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,576 INFO L290 TraceCheckUtils]: 148: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,577 INFO L290 TraceCheckUtils]: 149: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,577 INFO L290 TraceCheckUtils]: 150: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,577 INFO L290 TraceCheckUtils]: 151: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,577 INFO L290 TraceCheckUtils]: 152: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,578 INFO L290 TraceCheckUtils]: 153: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,578 INFO L290 TraceCheckUtils]: 154: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,578 INFO L290 TraceCheckUtils]: 155: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,578 INFO L290 TraceCheckUtils]: 156: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,579 INFO L290 TraceCheckUtils]: 157: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,579 INFO L290 TraceCheckUtils]: 158: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,579 INFO L290 TraceCheckUtils]: 159: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,579 INFO L290 TraceCheckUtils]: 160: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,580 INFO L290 TraceCheckUtils]: 161: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,580 INFO L290 TraceCheckUtils]: 162: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,580 INFO L290 TraceCheckUtils]: 163: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,580 INFO L290 TraceCheckUtils]: 164: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,580 INFO L290 TraceCheckUtils]: 165: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,581 INFO L290 TraceCheckUtils]: 166: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,581 INFO L290 TraceCheckUtils]: 167: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,581 INFO L290 TraceCheckUtils]: 168: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,581 INFO L290 TraceCheckUtils]: 169: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,582 INFO L290 TraceCheckUtils]: 170: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,582 INFO L290 TraceCheckUtils]: 171: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,582 INFO L290 TraceCheckUtils]: 172: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,582 INFO L290 TraceCheckUtils]: 173: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,583 INFO L290 TraceCheckUtils]: 174: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,583 INFO L290 TraceCheckUtils]: 175: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,583 INFO L290 TraceCheckUtils]: 176: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,583 INFO L290 TraceCheckUtils]: 177: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,584 INFO L290 TraceCheckUtils]: 178: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,584 INFO L290 TraceCheckUtils]: 179: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,584 INFO L290 TraceCheckUtils]: 180: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,584 INFO L290 TraceCheckUtils]: 181: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,585 INFO L290 TraceCheckUtils]: 182: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,585 INFO L290 TraceCheckUtils]: 183: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,585 INFO L290 TraceCheckUtils]: 184: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,585 INFO L290 TraceCheckUtils]: 185: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,585 INFO L290 TraceCheckUtils]: 186: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,586 INFO L290 TraceCheckUtils]: 187: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,586 INFO L290 TraceCheckUtils]: 188: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,586 INFO L290 TraceCheckUtils]: 189: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,586 INFO L290 TraceCheckUtils]: 190: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,587 INFO L290 TraceCheckUtils]: 191: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,587 INFO L290 TraceCheckUtils]: 192: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,587 INFO L290 TraceCheckUtils]: 193: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,587 INFO L290 TraceCheckUtils]: 194: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,588 INFO L290 TraceCheckUtils]: 195: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,588 INFO L290 TraceCheckUtils]: 196: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,588 INFO L290 TraceCheckUtils]: 197: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,588 INFO L290 TraceCheckUtils]: 198: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,589 INFO L290 TraceCheckUtils]: 199: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,589 INFO L290 TraceCheckUtils]: 200: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,589 INFO L290 TraceCheckUtils]: 201: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,589 INFO L290 TraceCheckUtils]: 202: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,590 INFO L290 TraceCheckUtils]: 203: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,590 INFO L290 TraceCheckUtils]: 204: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,590 INFO L290 TraceCheckUtils]: 205: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,590 INFO L290 TraceCheckUtils]: 206: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,590 INFO L290 TraceCheckUtils]: 207: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,591 INFO L290 TraceCheckUtils]: 208: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,591 INFO L290 TraceCheckUtils]: 209: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,591 INFO L290 TraceCheckUtils]: 210: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,591 INFO L290 TraceCheckUtils]: 211: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,592 INFO L290 TraceCheckUtils]: 212: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,592 INFO L290 TraceCheckUtils]: 213: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,592 INFO L290 TraceCheckUtils]: 214: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,592 INFO L290 TraceCheckUtils]: 215: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,593 INFO L290 TraceCheckUtils]: 216: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,593 INFO L290 TraceCheckUtils]: 217: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,593 INFO L290 TraceCheckUtils]: 218: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,593 INFO L290 TraceCheckUtils]: 219: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,594 INFO L290 TraceCheckUtils]: 220: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,594 INFO L290 TraceCheckUtils]: 221: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,594 INFO L290 TraceCheckUtils]: 222: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,594 INFO L290 TraceCheckUtils]: 223: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,594 INFO L290 TraceCheckUtils]: 224: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,595 INFO L290 TraceCheckUtils]: 225: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,595 INFO L290 TraceCheckUtils]: 226: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,595 INFO L290 TraceCheckUtils]: 227: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,595 INFO L290 TraceCheckUtils]: 228: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,596 INFO L290 TraceCheckUtils]: 229: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,596 INFO L290 TraceCheckUtils]: 230: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,596 INFO L290 TraceCheckUtils]: 231: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,596 INFO L290 TraceCheckUtils]: 232: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,597 INFO L290 TraceCheckUtils]: 233: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,597 INFO L290 TraceCheckUtils]: 234: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,597 INFO L290 TraceCheckUtils]: 235: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,597 INFO L290 TraceCheckUtils]: 236: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,598 INFO L290 TraceCheckUtils]: 237: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,598 INFO L290 TraceCheckUtils]: 238: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,598 INFO L290 TraceCheckUtils]: 239: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,598 INFO L290 TraceCheckUtils]: 240: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,598 INFO L290 TraceCheckUtils]: 241: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,599 INFO L290 TraceCheckUtils]: 242: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,599 INFO L290 TraceCheckUtils]: 243: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,599 INFO L290 TraceCheckUtils]: 244: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,599 INFO L290 TraceCheckUtils]: 245: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,600 INFO L290 TraceCheckUtils]: 246: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,600 INFO L290 TraceCheckUtils]: 247: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,600 INFO L290 TraceCheckUtils]: 248: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,600 INFO L290 TraceCheckUtils]: 249: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,601 INFO L290 TraceCheckUtils]: 250: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,601 INFO L290 TraceCheckUtils]: 251: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,601 INFO L290 TraceCheckUtils]: 252: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,601 INFO L290 TraceCheckUtils]: 253: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,602 INFO L290 TraceCheckUtils]: 254: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,602 INFO L290 TraceCheckUtils]: 255: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,602 INFO L290 TraceCheckUtils]: 256: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,602 INFO L290 TraceCheckUtils]: 257: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,602 INFO L290 TraceCheckUtils]: 258: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,603 INFO L290 TraceCheckUtils]: 259: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,603 INFO L290 TraceCheckUtils]: 260: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,603 INFO L290 TraceCheckUtils]: 261: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,603 INFO L290 TraceCheckUtils]: 262: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,604 INFO L290 TraceCheckUtils]: 263: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,604 INFO L290 TraceCheckUtils]: 264: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,604 INFO L290 TraceCheckUtils]: 265: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,604 INFO L290 TraceCheckUtils]: 266: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,605 INFO L290 TraceCheckUtils]: 267: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,605 INFO L290 TraceCheckUtils]: 268: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,605 INFO L290 TraceCheckUtils]: 269: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,605 INFO L290 TraceCheckUtils]: 270: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,606 INFO L290 TraceCheckUtils]: 271: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,606 INFO L290 TraceCheckUtils]: 272: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,606 INFO L290 TraceCheckUtils]: 273: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,606 INFO L290 TraceCheckUtils]: 274: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,606 INFO L290 TraceCheckUtils]: 275: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,607 INFO L290 TraceCheckUtils]: 276: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,607 INFO L290 TraceCheckUtils]: 277: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,607 INFO L290 TraceCheckUtils]: 278: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,607 INFO L290 TraceCheckUtils]: 279: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,608 INFO L290 TraceCheckUtils]: 280: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,608 INFO L290 TraceCheckUtils]: 281: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,608 INFO L290 TraceCheckUtils]: 282: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,608 INFO L290 TraceCheckUtils]: 283: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,609 INFO L290 TraceCheckUtils]: 284: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,609 INFO L290 TraceCheckUtils]: 285: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,609 INFO L290 TraceCheckUtils]: 286: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,609 INFO L290 TraceCheckUtils]: 287: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,610 INFO L290 TraceCheckUtils]: 288: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,610 INFO L290 TraceCheckUtils]: 289: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,610 INFO L290 TraceCheckUtils]: 290: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,610 INFO L290 TraceCheckUtils]: 291: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,610 INFO L290 TraceCheckUtils]: 292: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,611 INFO L290 TraceCheckUtils]: 293: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,611 INFO L290 TraceCheckUtils]: 294: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,611 INFO L290 TraceCheckUtils]: 295: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,611 INFO L290 TraceCheckUtils]: 296: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,612 INFO L290 TraceCheckUtils]: 297: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,612 INFO L290 TraceCheckUtils]: 298: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,612 INFO L290 TraceCheckUtils]: 299: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,612 INFO L290 TraceCheckUtils]: 300: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,613 INFO L290 TraceCheckUtils]: 301: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,613 INFO L290 TraceCheckUtils]: 302: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,613 INFO L290 TraceCheckUtils]: 303: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,613 INFO L290 TraceCheckUtils]: 304: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,614 INFO L290 TraceCheckUtils]: 305: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,614 INFO L290 TraceCheckUtils]: 306: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,614 INFO L290 TraceCheckUtils]: 307: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,614 INFO L290 TraceCheckUtils]: 308: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,614 INFO L290 TraceCheckUtils]: 309: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,615 INFO L290 TraceCheckUtils]: 310: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,615 INFO L290 TraceCheckUtils]: 311: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,615 INFO L290 TraceCheckUtils]: 312: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,616 INFO L290 TraceCheckUtils]: 313: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,616 INFO L290 TraceCheckUtils]: 314: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,616 INFO L290 TraceCheckUtils]: 315: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,616 INFO L290 TraceCheckUtils]: 316: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,616 INFO L290 TraceCheckUtils]: 317: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,617 INFO L290 TraceCheckUtils]: 318: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,617 INFO L290 TraceCheckUtils]: 319: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,617 INFO L290 TraceCheckUtils]: 320: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,617 INFO L290 TraceCheckUtils]: 321: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,618 INFO L290 TraceCheckUtils]: 322: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,618 INFO L290 TraceCheckUtils]: 323: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,618 INFO L290 TraceCheckUtils]: 324: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,618 INFO L290 TraceCheckUtils]: 325: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,619 INFO L290 TraceCheckUtils]: 326: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,619 INFO L290 TraceCheckUtils]: 327: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,619 INFO L290 TraceCheckUtils]: 328: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,619 INFO L290 TraceCheckUtils]: 329: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,620 INFO L290 TraceCheckUtils]: 330: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,620 INFO L290 TraceCheckUtils]: 331: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,620 INFO L290 TraceCheckUtils]: 332: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,620 INFO L290 TraceCheckUtils]: 333: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,621 INFO L290 TraceCheckUtils]: 334: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,621 INFO L290 TraceCheckUtils]: 335: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,621 INFO L290 TraceCheckUtils]: 336: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,621 INFO L290 TraceCheckUtils]: 337: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,621 INFO L290 TraceCheckUtils]: 338: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:38,622 INFO L290 TraceCheckUtils]: 339: Hoare triple {48911#(<= 20 main_~edgecount~0)} ~i~0 := 0; {49938#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:38,622 INFO L290 TraceCheckUtils]: 340: Hoare triple {49938#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {49938#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:38,623 INFO L290 TraceCheckUtils]: 341: Hoare triple {49938#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {49938#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:38,623 INFO L290 TraceCheckUtils]: 342: Hoare triple {49938#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {49948#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:38,624 INFO L290 TraceCheckUtils]: 343: Hoare triple {49948#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {49948#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:38,624 INFO L290 TraceCheckUtils]: 344: Hoare triple {49948#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {49948#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:38,624 INFO L290 TraceCheckUtils]: 345: Hoare triple {49948#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {49958#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:38,625 INFO L290 TraceCheckUtils]: 346: Hoare triple {49958#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {49958#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:38,625 INFO L290 TraceCheckUtils]: 347: Hoare triple {49958#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {49958#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:38,625 INFO L290 TraceCheckUtils]: 348: Hoare triple {49958#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {49968#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:38,626 INFO L290 TraceCheckUtils]: 349: Hoare triple {49968#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {49968#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:38,626 INFO L290 TraceCheckUtils]: 350: Hoare triple {49968#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {49968#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:38,627 INFO L290 TraceCheckUtils]: 351: Hoare triple {49968#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {49978#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-08 03:36:38,627 INFO L290 TraceCheckUtils]: 352: Hoare triple {49978#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} assume !(~i~0 < ~edgecount~0); {48907#false} is VALID [2022-04-08 03:36:38,627 INFO L290 TraceCheckUtils]: 353: Hoare triple {48907#false} ~i~0 := 0; {48907#false} is VALID [2022-04-08 03:36:38,627 INFO L290 TraceCheckUtils]: 354: Hoare triple {48907#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48907#false} is VALID [2022-04-08 03:36:38,627 INFO L272 TraceCheckUtils]: 355: Hoare triple {48907#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {48907#false} is VALID [2022-04-08 03:36:38,627 INFO L290 TraceCheckUtils]: 356: Hoare triple {48907#false} ~cond := #in~cond; {48907#false} is VALID [2022-04-08 03:36:38,627 INFO L290 TraceCheckUtils]: 357: Hoare triple {48907#false} assume 0 == ~cond; {48907#false} is VALID [2022-04-08 03:36:38,627 INFO L290 TraceCheckUtils]: 358: Hoare triple {48907#false} assume !false; {48907#false} is VALID [2022-04-08 03:36:38,628 INFO L134 CoverageAnalysis]: Checked inductivity of 15442 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 03:36:38,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:36:39,697 INFO L290 TraceCheckUtils]: 358: Hoare triple {48907#false} assume !false; {48907#false} is VALID [2022-04-08 03:36:39,698 INFO L290 TraceCheckUtils]: 357: Hoare triple {48907#false} assume 0 == ~cond; {48907#false} is VALID [2022-04-08 03:36:39,698 INFO L290 TraceCheckUtils]: 356: Hoare triple {48907#false} ~cond := #in~cond; {48907#false} is VALID [2022-04-08 03:36:39,698 INFO L272 TraceCheckUtils]: 355: Hoare triple {48907#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {48907#false} is VALID [2022-04-08 03:36:39,698 INFO L290 TraceCheckUtils]: 354: Hoare triple {48907#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48907#false} is VALID [2022-04-08 03:36:39,698 INFO L290 TraceCheckUtils]: 353: Hoare triple {48907#false} ~i~0 := 0; {48907#false} is VALID [2022-04-08 03:36:39,698 INFO L290 TraceCheckUtils]: 352: Hoare triple {50018#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {48907#false} is VALID [2022-04-08 03:36:39,698 INFO L290 TraceCheckUtils]: 351: Hoare triple {50022#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {50018#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,699 INFO L290 TraceCheckUtils]: 350: Hoare triple {50022#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {50022#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:39,699 INFO L290 TraceCheckUtils]: 349: Hoare triple {50022#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {50022#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:39,699 INFO L290 TraceCheckUtils]: 348: Hoare triple {50032#(< (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {50022#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:39,700 INFO L290 TraceCheckUtils]: 347: Hoare triple {50032#(< (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {50032#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:36:39,700 INFO L290 TraceCheckUtils]: 346: Hoare triple {50032#(< (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {50032#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:36:39,700 INFO L290 TraceCheckUtils]: 345: Hoare triple {50042#(< (+ main_~i~0 3) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {50032#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:36:39,701 INFO L290 TraceCheckUtils]: 344: Hoare triple {50042#(< (+ main_~i~0 3) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {50042#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:36:39,701 INFO L290 TraceCheckUtils]: 343: Hoare triple {50042#(< (+ main_~i~0 3) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {50042#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:36:39,701 INFO L290 TraceCheckUtils]: 342: Hoare triple {50052#(< (+ main_~i~0 4) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {50042#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:36:39,702 INFO L290 TraceCheckUtils]: 341: Hoare triple {50052#(< (+ main_~i~0 4) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {50052#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:36:39,702 INFO L290 TraceCheckUtils]: 340: Hoare triple {50052#(< (+ main_~i~0 4) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {50052#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:36:39,702 INFO L290 TraceCheckUtils]: 339: Hoare triple {50062#(< 4 main_~edgecount~0)} ~i~0 := 0; {50052#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:36:39,703 INFO L290 TraceCheckUtils]: 338: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,703 INFO L290 TraceCheckUtils]: 337: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,703 INFO L290 TraceCheckUtils]: 336: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,703 INFO L290 TraceCheckUtils]: 335: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,704 INFO L290 TraceCheckUtils]: 334: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,704 INFO L290 TraceCheckUtils]: 333: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,704 INFO L290 TraceCheckUtils]: 332: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,704 INFO L290 TraceCheckUtils]: 331: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,705 INFO L290 TraceCheckUtils]: 330: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,705 INFO L290 TraceCheckUtils]: 329: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,705 INFO L290 TraceCheckUtils]: 328: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,705 INFO L290 TraceCheckUtils]: 327: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,706 INFO L290 TraceCheckUtils]: 326: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,706 INFO L290 TraceCheckUtils]: 325: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,706 INFO L290 TraceCheckUtils]: 324: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,706 INFO L290 TraceCheckUtils]: 323: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,707 INFO L290 TraceCheckUtils]: 322: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,707 INFO L290 TraceCheckUtils]: 321: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,707 INFO L290 TraceCheckUtils]: 320: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,707 INFO L290 TraceCheckUtils]: 319: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,708 INFO L290 TraceCheckUtils]: 318: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,708 INFO L290 TraceCheckUtils]: 317: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,708 INFO L290 TraceCheckUtils]: 316: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,709 INFO L290 TraceCheckUtils]: 315: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,709 INFO L290 TraceCheckUtils]: 314: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,709 INFO L290 TraceCheckUtils]: 313: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,709 INFO L290 TraceCheckUtils]: 312: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,710 INFO L290 TraceCheckUtils]: 311: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,710 INFO L290 TraceCheckUtils]: 310: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,710 INFO L290 TraceCheckUtils]: 309: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,710 INFO L290 TraceCheckUtils]: 308: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,711 INFO L290 TraceCheckUtils]: 307: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,711 INFO L290 TraceCheckUtils]: 306: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,711 INFO L290 TraceCheckUtils]: 305: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,711 INFO L290 TraceCheckUtils]: 304: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,712 INFO L290 TraceCheckUtils]: 303: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,712 INFO L290 TraceCheckUtils]: 302: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,712 INFO L290 TraceCheckUtils]: 301: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,713 INFO L290 TraceCheckUtils]: 300: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,713 INFO L290 TraceCheckUtils]: 299: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,713 INFO L290 TraceCheckUtils]: 298: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,713 INFO L290 TraceCheckUtils]: 297: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,714 INFO L290 TraceCheckUtils]: 296: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,714 INFO L290 TraceCheckUtils]: 295: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,714 INFO L290 TraceCheckUtils]: 294: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,714 INFO L290 TraceCheckUtils]: 293: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,715 INFO L290 TraceCheckUtils]: 292: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,715 INFO L290 TraceCheckUtils]: 291: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,715 INFO L290 TraceCheckUtils]: 290: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,716 INFO L290 TraceCheckUtils]: 289: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,716 INFO L290 TraceCheckUtils]: 288: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,716 INFO L290 TraceCheckUtils]: 287: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,716 INFO L290 TraceCheckUtils]: 286: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,717 INFO L290 TraceCheckUtils]: 285: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,717 INFO L290 TraceCheckUtils]: 284: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,717 INFO L290 TraceCheckUtils]: 283: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,717 INFO L290 TraceCheckUtils]: 282: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,718 INFO L290 TraceCheckUtils]: 281: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,718 INFO L290 TraceCheckUtils]: 280: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,718 INFO L290 TraceCheckUtils]: 279: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,719 INFO L290 TraceCheckUtils]: 278: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,719 INFO L290 TraceCheckUtils]: 277: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,719 INFO L290 TraceCheckUtils]: 276: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,719 INFO L290 TraceCheckUtils]: 275: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,720 INFO L290 TraceCheckUtils]: 274: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,720 INFO L290 TraceCheckUtils]: 273: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,720 INFO L290 TraceCheckUtils]: 272: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,720 INFO L290 TraceCheckUtils]: 271: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,721 INFO L290 TraceCheckUtils]: 270: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,721 INFO L290 TraceCheckUtils]: 269: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,721 INFO L290 TraceCheckUtils]: 268: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,721 INFO L290 TraceCheckUtils]: 267: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,722 INFO L290 TraceCheckUtils]: 266: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,722 INFO L290 TraceCheckUtils]: 265: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,722 INFO L290 TraceCheckUtils]: 264: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,722 INFO L290 TraceCheckUtils]: 263: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,723 INFO L290 TraceCheckUtils]: 262: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,723 INFO L290 TraceCheckUtils]: 261: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,723 INFO L290 TraceCheckUtils]: 260: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,724 INFO L290 TraceCheckUtils]: 259: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,724 INFO L290 TraceCheckUtils]: 258: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,724 INFO L290 TraceCheckUtils]: 257: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,724 INFO L290 TraceCheckUtils]: 256: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,725 INFO L290 TraceCheckUtils]: 255: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,725 INFO L290 TraceCheckUtils]: 254: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,725 INFO L290 TraceCheckUtils]: 253: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,726 INFO L290 TraceCheckUtils]: 252: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,726 INFO L290 TraceCheckUtils]: 251: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,726 INFO L290 TraceCheckUtils]: 250: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,727 INFO L290 TraceCheckUtils]: 249: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,727 INFO L290 TraceCheckUtils]: 248: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,727 INFO L290 TraceCheckUtils]: 247: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,727 INFO L290 TraceCheckUtils]: 246: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,728 INFO L290 TraceCheckUtils]: 245: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,728 INFO L290 TraceCheckUtils]: 244: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,728 INFO L290 TraceCheckUtils]: 243: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,728 INFO L290 TraceCheckUtils]: 242: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,729 INFO L290 TraceCheckUtils]: 241: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,729 INFO L290 TraceCheckUtils]: 240: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,729 INFO L290 TraceCheckUtils]: 239: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,729 INFO L290 TraceCheckUtils]: 238: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,730 INFO L290 TraceCheckUtils]: 237: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,730 INFO L290 TraceCheckUtils]: 236: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,730 INFO L290 TraceCheckUtils]: 235: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,731 INFO L290 TraceCheckUtils]: 234: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,731 INFO L290 TraceCheckUtils]: 233: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,731 INFO L290 TraceCheckUtils]: 232: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,731 INFO L290 TraceCheckUtils]: 231: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,732 INFO L290 TraceCheckUtils]: 230: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,732 INFO L290 TraceCheckUtils]: 229: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,732 INFO L290 TraceCheckUtils]: 228: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,732 INFO L290 TraceCheckUtils]: 227: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,733 INFO L290 TraceCheckUtils]: 226: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,733 INFO L290 TraceCheckUtils]: 225: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,733 INFO L290 TraceCheckUtils]: 224: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,733 INFO L290 TraceCheckUtils]: 223: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,734 INFO L290 TraceCheckUtils]: 222: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,734 INFO L290 TraceCheckUtils]: 221: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,734 INFO L290 TraceCheckUtils]: 220: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,734 INFO L290 TraceCheckUtils]: 219: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,735 INFO L290 TraceCheckUtils]: 218: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,735 INFO L290 TraceCheckUtils]: 217: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,735 INFO L290 TraceCheckUtils]: 216: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,736 INFO L290 TraceCheckUtils]: 215: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,736 INFO L290 TraceCheckUtils]: 214: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,736 INFO L290 TraceCheckUtils]: 213: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,736 INFO L290 TraceCheckUtils]: 212: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,737 INFO L290 TraceCheckUtils]: 211: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,737 INFO L290 TraceCheckUtils]: 210: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,737 INFO L290 TraceCheckUtils]: 209: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,737 INFO L290 TraceCheckUtils]: 208: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,738 INFO L290 TraceCheckUtils]: 207: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,738 INFO L290 TraceCheckUtils]: 206: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,738 INFO L290 TraceCheckUtils]: 205: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,738 INFO L290 TraceCheckUtils]: 204: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,739 INFO L290 TraceCheckUtils]: 203: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,739 INFO L290 TraceCheckUtils]: 202: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,739 INFO L290 TraceCheckUtils]: 201: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,739 INFO L290 TraceCheckUtils]: 200: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,740 INFO L290 TraceCheckUtils]: 199: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,740 INFO L290 TraceCheckUtils]: 198: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,740 INFO L290 TraceCheckUtils]: 197: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,740 INFO L290 TraceCheckUtils]: 196: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,741 INFO L290 TraceCheckUtils]: 195: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,741 INFO L290 TraceCheckUtils]: 194: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,741 INFO L290 TraceCheckUtils]: 193: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,741 INFO L290 TraceCheckUtils]: 192: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,742 INFO L290 TraceCheckUtils]: 191: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,742 INFO L290 TraceCheckUtils]: 190: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,742 INFO L290 TraceCheckUtils]: 189: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,742 INFO L290 TraceCheckUtils]: 188: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,743 INFO L290 TraceCheckUtils]: 187: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,743 INFO L290 TraceCheckUtils]: 186: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,743 INFO L290 TraceCheckUtils]: 185: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,744 INFO L290 TraceCheckUtils]: 184: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,744 INFO L290 TraceCheckUtils]: 183: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,744 INFO L290 TraceCheckUtils]: 182: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,744 INFO L290 TraceCheckUtils]: 181: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,745 INFO L290 TraceCheckUtils]: 180: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,745 INFO L290 TraceCheckUtils]: 179: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,745 INFO L290 TraceCheckUtils]: 178: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,745 INFO L290 TraceCheckUtils]: 177: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,746 INFO L290 TraceCheckUtils]: 176: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,746 INFO L290 TraceCheckUtils]: 175: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,746 INFO L290 TraceCheckUtils]: 174: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,746 INFO L290 TraceCheckUtils]: 173: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,747 INFO L290 TraceCheckUtils]: 172: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,747 INFO L290 TraceCheckUtils]: 171: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,747 INFO L290 TraceCheckUtils]: 170: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,748 INFO L290 TraceCheckUtils]: 169: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,748 INFO L290 TraceCheckUtils]: 168: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,748 INFO L290 TraceCheckUtils]: 167: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,748 INFO L290 TraceCheckUtils]: 166: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,749 INFO L290 TraceCheckUtils]: 165: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,749 INFO L290 TraceCheckUtils]: 164: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,749 INFO L290 TraceCheckUtils]: 163: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,749 INFO L290 TraceCheckUtils]: 162: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,750 INFO L290 TraceCheckUtils]: 161: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,750 INFO L290 TraceCheckUtils]: 160: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,750 INFO L290 TraceCheckUtils]: 159: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,750 INFO L290 TraceCheckUtils]: 158: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,751 INFO L290 TraceCheckUtils]: 157: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,751 INFO L290 TraceCheckUtils]: 156: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,751 INFO L290 TraceCheckUtils]: 155: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,751 INFO L290 TraceCheckUtils]: 154: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,752 INFO L290 TraceCheckUtils]: 153: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,752 INFO L290 TraceCheckUtils]: 152: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,752 INFO L290 TraceCheckUtils]: 151: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,752 INFO L290 TraceCheckUtils]: 150: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,753 INFO L290 TraceCheckUtils]: 149: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,753 INFO L290 TraceCheckUtils]: 148: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,753 INFO L290 TraceCheckUtils]: 147: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,754 INFO L290 TraceCheckUtils]: 146: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,754 INFO L290 TraceCheckUtils]: 145: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,754 INFO L290 TraceCheckUtils]: 144: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,754 INFO L290 TraceCheckUtils]: 143: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,755 INFO L290 TraceCheckUtils]: 142: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,755 INFO L290 TraceCheckUtils]: 141: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,755 INFO L290 TraceCheckUtils]: 140: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,755 INFO L290 TraceCheckUtils]: 139: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,756 INFO L290 TraceCheckUtils]: 138: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,756 INFO L290 TraceCheckUtils]: 137: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,756 INFO L290 TraceCheckUtils]: 136: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,757 INFO L290 TraceCheckUtils]: 135: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,757 INFO L290 TraceCheckUtils]: 134: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,757 INFO L290 TraceCheckUtils]: 133: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,757 INFO L290 TraceCheckUtils]: 132: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,758 INFO L290 TraceCheckUtils]: 131: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,758 INFO L290 TraceCheckUtils]: 130: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,758 INFO L290 TraceCheckUtils]: 129: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,758 INFO L290 TraceCheckUtils]: 128: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,759 INFO L290 TraceCheckUtils]: 127: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,759 INFO L290 TraceCheckUtils]: 126: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,759 INFO L290 TraceCheckUtils]: 125: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,759 INFO L290 TraceCheckUtils]: 124: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,760 INFO L290 TraceCheckUtils]: 123: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,760 INFO L290 TraceCheckUtils]: 122: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,760 INFO L290 TraceCheckUtils]: 121: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,761 INFO L290 TraceCheckUtils]: 120: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,761 INFO L290 TraceCheckUtils]: 119: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,761 INFO L290 TraceCheckUtils]: 118: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,761 INFO L290 TraceCheckUtils]: 117: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,762 INFO L290 TraceCheckUtils]: 116: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,762 INFO L290 TraceCheckUtils]: 115: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,762 INFO L290 TraceCheckUtils]: 114: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,762 INFO L290 TraceCheckUtils]: 113: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,763 INFO L290 TraceCheckUtils]: 112: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,763 INFO L290 TraceCheckUtils]: 111: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,763 INFO L290 TraceCheckUtils]: 110: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,763 INFO L290 TraceCheckUtils]: 109: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,764 INFO L290 TraceCheckUtils]: 108: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,764 INFO L290 TraceCheckUtils]: 107: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,764 INFO L290 TraceCheckUtils]: 106: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,764 INFO L290 TraceCheckUtils]: 105: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,765 INFO L290 TraceCheckUtils]: 104: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,765 INFO L290 TraceCheckUtils]: 103: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,765 INFO L290 TraceCheckUtils]: 102: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,766 INFO L290 TraceCheckUtils]: 101: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,766 INFO L290 TraceCheckUtils]: 100: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,766 INFO L290 TraceCheckUtils]: 99: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,766 INFO L290 TraceCheckUtils]: 98: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,767 INFO L290 TraceCheckUtils]: 97: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,767 INFO L290 TraceCheckUtils]: 96: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,767 INFO L290 TraceCheckUtils]: 95: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,767 INFO L290 TraceCheckUtils]: 94: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,768 INFO L290 TraceCheckUtils]: 93: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,768 INFO L290 TraceCheckUtils]: 92: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,768 INFO L290 TraceCheckUtils]: 91: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,768 INFO L290 TraceCheckUtils]: 90: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,769 INFO L290 TraceCheckUtils]: 89: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,769 INFO L290 TraceCheckUtils]: 88: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,769 INFO L290 TraceCheckUtils]: 87: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,769 INFO L290 TraceCheckUtils]: 86: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,770 INFO L290 TraceCheckUtils]: 85: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,770 INFO L290 TraceCheckUtils]: 84: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,770 INFO L290 TraceCheckUtils]: 83: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,771 INFO L290 TraceCheckUtils]: 82: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,771 INFO L290 TraceCheckUtils]: 81: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,771 INFO L290 TraceCheckUtils]: 80: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,771 INFO L290 TraceCheckUtils]: 79: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,772 INFO L290 TraceCheckUtils]: 78: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,772 INFO L290 TraceCheckUtils]: 77: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,772 INFO L290 TraceCheckUtils]: 76: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,772 INFO L290 TraceCheckUtils]: 75: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,773 INFO L290 TraceCheckUtils]: 74: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,773 INFO L290 TraceCheckUtils]: 73: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,773 INFO L290 TraceCheckUtils]: 72: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,773 INFO L290 TraceCheckUtils]: 71: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,774 INFO L290 TraceCheckUtils]: 70: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,774 INFO L290 TraceCheckUtils]: 69: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,774 INFO L290 TraceCheckUtils]: 68: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,774 INFO L290 TraceCheckUtils]: 67: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,775 INFO L290 TraceCheckUtils]: 66: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,775 INFO L290 TraceCheckUtils]: 65: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,775 INFO L290 TraceCheckUtils]: 64: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,776 INFO L290 TraceCheckUtils]: 63: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,776 INFO L290 TraceCheckUtils]: 62: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,776 INFO L290 TraceCheckUtils]: 61: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,776 INFO L290 TraceCheckUtils]: 60: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,777 INFO L290 TraceCheckUtils]: 59: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,777 INFO L290 TraceCheckUtils]: 58: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,777 INFO L290 TraceCheckUtils]: 57: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,777 INFO L290 TraceCheckUtils]: 56: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,778 INFO L290 TraceCheckUtils]: 55: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,778 INFO L290 TraceCheckUtils]: 54: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,778 INFO L290 TraceCheckUtils]: 53: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,778 INFO L290 TraceCheckUtils]: 52: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,779 INFO L290 TraceCheckUtils]: 51: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,779 INFO L290 TraceCheckUtils]: 50: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,779 INFO L290 TraceCheckUtils]: 49: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,779 INFO L290 TraceCheckUtils]: 48: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,780 INFO L290 TraceCheckUtils]: 47: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,780 INFO L290 TraceCheckUtils]: 46: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,781 INFO L290 TraceCheckUtils]: 43: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,781 INFO L290 TraceCheckUtils]: 42: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,781 INFO L290 TraceCheckUtils]: 40: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,783 INFO L290 TraceCheckUtils]: 36: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,783 INFO L290 TraceCheckUtils]: 34: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,783 INFO L290 TraceCheckUtils]: 33: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {50062#(< 4 main_~edgecount~0)} ~i~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {50062#(< 4 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {48906#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-08 03:36:39,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {48906#true} call #t~ret22 := main(); {48906#true} is VALID [2022-04-08 03:36:39,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48906#true} {48906#true} #107#return; {48906#true} is VALID [2022-04-08 03:36:39,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {48906#true} assume true; {48906#true} is VALID [2022-04-08 03:36:39,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {48906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {48906#true} is VALID [2022-04-08 03:36:39,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {48906#true} call ULTIMATE.init(); {48906#true} is VALID [2022-04-08 03:36:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 15442 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 03:36:39,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852890695] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:36:39,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:36:39,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-04-08 03:36:39,794 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:36:39,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1077873977] [2022-04-08 03:36:39,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1077873977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:36:39,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:36:39,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 03:36:39,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876357752] [2022-04-08 03:36:39,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:36:39,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 359 [2022-04-08 03:36:39,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:36:39,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:39,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:39,824 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 03:36:39,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:39,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 03:36:39,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-08 03:36:39,824 INFO L87 Difference]: Start difference. First operand 364 states and 473 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:42,153 INFO L93 Difference]: Finished difference Result 464 states and 600 transitions. [2022-04-08 03:36:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:36:42,153 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 359 [2022-04-08 03:36:42,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:36:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2022-04-08 03:36:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:42,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2022-04-08 03:36:42,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 138 transitions. [2022-04-08 03:36:42,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:42,266 INFO L225 Difference]: With dead ends: 464 [2022-04-08 03:36:42,266 INFO L226 Difference]: Without dead ends: 453 [2022-04-08 03:36:42,266 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 709 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=239, Invalid=411, Unknown=0, NotChecked=0, Total=650 [2022-04-08 03:36:42,266 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 212 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:36:42,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 39 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:36:42,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-04-08 03:36:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 367. [2022-04-08 03:36:43,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:36:43,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 453 states. Second operand has 367 states, 361 states have (on average 1.3047091412742382) internal successors, (471), 361 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:43,844 INFO L74 IsIncluded]: Start isIncluded. First operand 453 states. Second operand has 367 states, 361 states have (on average 1.3047091412742382) internal successors, (471), 361 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:43,844 INFO L87 Difference]: Start difference. First operand 453 states. Second operand has 367 states, 361 states have (on average 1.3047091412742382) internal successors, (471), 361 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:43,851 INFO L93 Difference]: Finished difference Result 453 states and 588 transitions. [2022-04-08 03:36:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 588 transitions. [2022-04-08 03:36:43,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:43,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:43,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 367 states, 361 states have (on average 1.3047091412742382) internal successors, (471), 361 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 453 states. [2022-04-08 03:36:43,852 INFO L87 Difference]: Start difference. First operand has 367 states, 361 states have (on average 1.3047091412742382) internal successors, (471), 361 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 453 states. [2022-04-08 03:36:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:43,860 INFO L93 Difference]: Finished difference Result 453 states and 588 transitions. [2022-04-08 03:36:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 588 transitions. [2022-04-08 03:36:43,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:43,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:43,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:36:43,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:36:43,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 361 states have (on average 1.3047091412742382) internal successors, (471), 361 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 476 transitions. [2022-04-08 03:36:43,866 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 476 transitions. Word has length 359 [2022-04-08 03:36:43,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:36:43,867 INFO L478 AbstractCegarLoop]: Abstraction has 367 states and 476 transitions. [2022-04-08 03:36:43,867 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:43,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 367 states and 476 transitions. [2022-04-08 03:36:44,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:44,786 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 476 transitions. [2022-04-08 03:36:44,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2022-04-08 03:36:44,787 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:36:44,787 INFO L499 BasicCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:36:44,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-08 03:36:44,988 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:36:44,988 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:36:44,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:36:44,988 INFO L85 PathProgramCache]: Analyzing trace with hash -121056614, now seen corresponding path program 61 times [2022-04-08 03:36:44,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:44,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [667095240] [2022-04-08 03:36:44,997 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:36:44,997 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:36:44,998 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:36:44,998 INFO L85 PathProgramCache]: Analyzing trace with hash -121056614, now seen corresponding path program 62 times [2022-04-08 03:36:44,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:36:44,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692579229] [2022-04-08 03:36:44,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:36:44,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:36:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:45,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:36:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:45,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {53674#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {53662#true} is VALID [2022-04-08 03:36:45,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {53662#true} assume true; {53662#true} is VALID [2022-04-08 03:36:45,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53662#true} {53662#true} #107#return; {53662#true} is VALID [2022-04-08 03:36:45,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {53662#true} call ULTIMATE.init(); {53674#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:36:45,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {53674#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {53662#true} is VALID [2022-04-08 03:36:45,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {53662#true} assume true; {53662#true} is VALID [2022-04-08 03:36:45,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53662#true} {53662#true} #107#return; {53662#true} is VALID [2022-04-08 03:36:45,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {53662#true} call #t~ret22 := main(); {53662#true} is VALID [2022-04-08 03:36:45,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {53662#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {53667#(<= 20 main_~edgecount~0)} ~i~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,334 INFO L290 TraceCheckUtils]: 41: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,334 INFO L290 TraceCheckUtils]: 42: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,335 INFO L290 TraceCheckUtils]: 46: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,336 INFO L290 TraceCheckUtils]: 47: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,336 INFO L290 TraceCheckUtils]: 49: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,336 INFO L290 TraceCheckUtils]: 51: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,337 INFO L290 TraceCheckUtils]: 52: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,337 INFO L290 TraceCheckUtils]: 53: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,337 INFO L290 TraceCheckUtils]: 54: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,337 INFO L290 TraceCheckUtils]: 55: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,338 INFO L290 TraceCheckUtils]: 56: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,338 INFO L290 TraceCheckUtils]: 57: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,338 INFO L290 TraceCheckUtils]: 58: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,338 INFO L290 TraceCheckUtils]: 59: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,338 INFO L290 TraceCheckUtils]: 60: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,339 INFO L290 TraceCheckUtils]: 61: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,339 INFO L290 TraceCheckUtils]: 62: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,339 INFO L290 TraceCheckUtils]: 63: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,339 INFO L290 TraceCheckUtils]: 64: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,340 INFO L290 TraceCheckUtils]: 65: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,340 INFO L290 TraceCheckUtils]: 66: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,340 INFO L290 TraceCheckUtils]: 67: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,340 INFO L290 TraceCheckUtils]: 68: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,341 INFO L290 TraceCheckUtils]: 69: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,341 INFO L290 TraceCheckUtils]: 70: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,341 INFO L290 TraceCheckUtils]: 71: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,341 INFO L290 TraceCheckUtils]: 72: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,341 INFO L290 TraceCheckUtils]: 73: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,342 INFO L290 TraceCheckUtils]: 74: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,342 INFO L290 TraceCheckUtils]: 75: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,342 INFO L290 TraceCheckUtils]: 76: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,342 INFO L290 TraceCheckUtils]: 77: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,343 INFO L290 TraceCheckUtils]: 78: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,343 INFO L290 TraceCheckUtils]: 79: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,343 INFO L290 TraceCheckUtils]: 80: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,343 INFO L290 TraceCheckUtils]: 81: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,343 INFO L290 TraceCheckUtils]: 82: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,344 INFO L290 TraceCheckUtils]: 83: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,344 INFO L290 TraceCheckUtils]: 84: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,344 INFO L290 TraceCheckUtils]: 85: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,344 INFO L290 TraceCheckUtils]: 86: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,344 INFO L290 TraceCheckUtils]: 87: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,345 INFO L290 TraceCheckUtils]: 88: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,345 INFO L290 TraceCheckUtils]: 89: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,345 INFO L290 TraceCheckUtils]: 90: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,345 INFO L290 TraceCheckUtils]: 91: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,345 INFO L290 TraceCheckUtils]: 92: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,346 INFO L290 TraceCheckUtils]: 93: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,346 INFO L290 TraceCheckUtils]: 94: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,346 INFO L290 TraceCheckUtils]: 95: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,346 INFO L290 TraceCheckUtils]: 96: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,346 INFO L290 TraceCheckUtils]: 97: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,347 INFO L290 TraceCheckUtils]: 98: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,347 INFO L290 TraceCheckUtils]: 99: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,347 INFO L290 TraceCheckUtils]: 100: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,347 INFO L290 TraceCheckUtils]: 101: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,348 INFO L290 TraceCheckUtils]: 102: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,348 INFO L290 TraceCheckUtils]: 103: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,348 INFO L290 TraceCheckUtils]: 104: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,348 INFO L290 TraceCheckUtils]: 105: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,348 INFO L290 TraceCheckUtils]: 106: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,349 INFO L290 TraceCheckUtils]: 107: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,349 INFO L290 TraceCheckUtils]: 108: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,349 INFO L290 TraceCheckUtils]: 109: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,349 INFO L290 TraceCheckUtils]: 110: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,349 INFO L290 TraceCheckUtils]: 111: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,350 INFO L290 TraceCheckUtils]: 112: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,350 INFO L290 TraceCheckUtils]: 113: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,350 INFO L290 TraceCheckUtils]: 114: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,350 INFO L290 TraceCheckUtils]: 115: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,350 INFO L290 TraceCheckUtils]: 116: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,351 INFO L290 TraceCheckUtils]: 117: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,351 INFO L290 TraceCheckUtils]: 118: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,351 INFO L290 TraceCheckUtils]: 119: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,351 INFO L290 TraceCheckUtils]: 120: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,351 INFO L290 TraceCheckUtils]: 121: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,352 INFO L290 TraceCheckUtils]: 122: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,352 INFO L290 TraceCheckUtils]: 123: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,352 INFO L290 TraceCheckUtils]: 124: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,352 INFO L290 TraceCheckUtils]: 125: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,352 INFO L290 TraceCheckUtils]: 126: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,353 INFO L290 TraceCheckUtils]: 127: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,353 INFO L290 TraceCheckUtils]: 128: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,353 INFO L290 TraceCheckUtils]: 129: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,353 INFO L290 TraceCheckUtils]: 130: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,354 INFO L290 TraceCheckUtils]: 131: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,354 INFO L290 TraceCheckUtils]: 132: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,354 INFO L290 TraceCheckUtils]: 133: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,354 INFO L290 TraceCheckUtils]: 134: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,354 INFO L290 TraceCheckUtils]: 135: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,355 INFO L290 TraceCheckUtils]: 136: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,355 INFO L290 TraceCheckUtils]: 137: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,355 INFO L290 TraceCheckUtils]: 138: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,355 INFO L290 TraceCheckUtils]: 139: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,355 INFO L290 TraceCheckUtils]: 140: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,356 INFO L290 TraceCheckUtils]: 141: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,356 INFO L290 TraceCheckUtils]: 142: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,356 INFO L290 TraceCheckUtils]: 143: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,356 INFO L290 TraceCheckUtils]: 144: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,356 INFO L290 TraceCheckUtils]: 145: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,357 INFO L290 TraceCheckUtils]: 146: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,357 INFO L290 TraceCheckUtils]: 147: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,357 INFO L290 TraceCheckUtils]: 148: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,357 INFO L290 TraceCheckUtils]: 149: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,357 INFO L290 TraceCheckUtils]: 150: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,358 INFO L290 TraceCheckUtils]: 151: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,358 INFO L290 TraceCheckUtils]: 152: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,358 INFO L290 TraceCheckUtils]: 153: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,358 INFO L290 TraceCheckUtils]: 154: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,359 INFO L290 TraceCheckUtils]: 155: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,359 INFO L290 TraceCheckUtils]: 156: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,359 INFO L290 TraceCheckUtils]: 157: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,359 INFO L290 TraceCheckUtils]: 158: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,359 INFO L290 TraceCheckUtils]: 159: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,360 INFO L290 TraceCheckUtils]: 160: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,360 INFO L290 TraceCheckUtils]: 161: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,360 INFO L290 TraceCheckUtils]: 162: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,360 INFO L290 TraceCheckUtils]: 163: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,360 INFO L290 TraceCheckUtils]: 164: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,361 INFO L290 TraceCheckUtils]: 165: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,361 INFO L290 TraceCheckUtils]: 166: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,361 INFO L290 TraceCheckUtils]: 167: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,361 INFO L290 TraceCheckUtils]: 168: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,361 INFO L290 TraceCheckUtils]: 169: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,362 INFO L290 TraceCheckUtils]: 170: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,362 INFO L290 TraceCheckUtils]: 171: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,362 INFO L290 TraceCheckUtils]: 172: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,362 INFO L290 TraceCheckUtils]: 173: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,362 INFO L290 TraceCheckUtils]: 174: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,363 INFO L290 TraceCheckUtils]: 175: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,363 INFO L290 TraceCheckUtils]: 176: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,363 INFO L290 TraceCheckUtils]: 177: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,363 INFO L290 TraceCheckUtils]: 178: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,364 INFO L290 TraceCheckUtils]: 179: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,364 INFO L290 TraceCheckUtils]: 180: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,364 INFO L290 TraceCheckUtils]: 181: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,364 INFO L290 TraceCheckUtils]: 182: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,364 INFO L290 TraceCheckUtils]: 183: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,365 INFO L290 TraceCheckUtils]: 184: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,365 INFO L290 TraceCheckUtils]: 185: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,365 INFO L290 TraceCheckUtils]: 186: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,365 INFO L290 TraceCheckUtils]: 187: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,365 INFO L290 TraceCheckUtils]: 188: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,366 INFO L290 TraceCheckUtils]: 189: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,366 INFO L290 TraceCheckUtils]: 190: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,366 INFO L290 TraceCheckUtils]: 191: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,366 INFO L290 TraceCheckUtils]: 192: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,366 INFO L290 TraceCheckUtils]: 193: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,367 INFO L290 TraceCheckUtils]: 194: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,367 INFO L290 TraceCheckUtils]: 195: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,367 INFO L290 TraceCheckUtils]: 196: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,367 INFO L290 TraceCheckUtils]: 197: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,368 INFO L290 TraceCheckUtils]: 198: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,368 INFO L290 TraceCheckUtils]: 199: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,368 INFO L290 TraceCheckUtils]: 200: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,368 INFO L290 TraceCheckUtils]: 201: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,368 INFO L290 TraceCheckUtils]: 202: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,369 INFO L290 TraceCheckUtils]: 203: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,369 INFO L290 TraceCheckUtils]: 204: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,369 INFO L290 TraceCheckUtils]: 205: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,369 INFO L290 TraceCheckUtils]: 206: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,369 INFO L290 TraceCheckUtils]: 207: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,370 INFO L290 TraceCheckUtils]: 208: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,370 INFO L290 TraceCheckUtils]: 209: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,370 INFO L290 TraceCheckUtils]: 210: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,370 INFO L290 TraceCheckUtils]: 211: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,370 INFO L290 TraceCheckUtils]: 212: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,371 INFO L290 TraceCheckUtils]: 213: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,371 INFO L290 TraceCheckUtils]: 214: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,371 INFO L290 TraceCheckUtils]: 215: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,371 INFO L290 TraceCheckUtils]: 216: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,371 INFO L290 TraceCheckUtils]: 217: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,372 INFO L290 TraceCheckUtils]: 218: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,372 INFO L290 TraceCheckUtils]: 219: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,372 INFO L290 TraceCheckUtils]: 220: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,372 INFO L290 TraceCheckUtils]: 221: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,373 INFO L290 TraceCheckUtils]: 222: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,373 INFO L290 TraceCheckUtils]: 223: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,373 INFO L290 TraceCheckUtils]: 224: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,373 INFO L290 TraceCheckUtils]: 225: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,373 INFO L290 TraceCheckUtils]: 226: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,374 INFO L290 TraceCheckUtils]: 227: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,374 INFO L290 TraceCheckUtils]: 228: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,374 INFO L290 TraceCheckUtils]: 229: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,374 INFO L290 TraceCheckUtils]: 230: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,374 INFO L290 TraceCheckUtils]: 231: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,375 INFO L290 TraceCheckUtils]: 232: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,375 INFO L290 TraceCheckUtils]: 233: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,375 INFO L290 TraceCheckUtils]: 234: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,375 INFO L290 TraceCheckUtils]: 235: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,375 INFO L290 TraceCheckUtils]: 236: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,376 INFO L290 TraceCheckUtils]: 237: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,376 INFO L290 TraceCheckUtils]: 238: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,376 INFO L290 TraceCheckUtils]: 239: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,376 INFO L290 TraceCheckUtils]: 240: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,377 INFO L290 TraceCheckUtils]: 241: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,377 INFO L290 TraceCheckUtils]: 242: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,377 INFO L290 TraceCheckUtils]: 243: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,377 INFO L290 TraceCheckUtils]: 244: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,377 INFO L290 TraceCheckUtils]: 245: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,378 INFO L290 TraceCheckUtils]: 246: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,378 INFO L290 TraceCheckUtils]: 247: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,378 INFO L290 TraceCheckUtils]: 248: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,378 INFO L290 TraceCheckUtils]: 249: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,378 INFO L290 TraceCheckUtils]: 250: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,379 INFO L290 TraceCheckUtils]: 251: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,379 INFO L290 TraceCheckUtils]: 252: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,379 INFO L290 TraceCheckUtils]: 253: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,379 INFO L290 TraceCheckUtils]: 254: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,379 INFO L290 TraceCheckUtils]: 255: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,380 INFO L290 TraceCheckUtils]: 256: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,380 INFO L290 TraceCheckUtils]: 257: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,380 INFO L290 TraceCheckUtils]: 258: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,380 INFO L290 TraceCheckUtils]: 259: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,381 INFO L290 TraceCheckUtils]: 260: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,381 INFO L290 TraceCheckUtils]: 261: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,381 INFO L290 TraceCheckUtils]: 262: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,381 INFO L290 TraceCheckUtils]: 263: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,381 INFO L290 TraceCheckUtils]: 264: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,382 INFO L290 TraceCheckUtils]: 265: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,382 INFO L290 TraceCheckUtils]: 266: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,382 INFO L290 TraceCheckUtils]: 267: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,382 INFO L290 TraceCheckUtils]: 268: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,382 INFO L290 TraceCheckUtils]: 269: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,383 INFO L290 TraceCheckUtils]: 270: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,383 INFO L290 TraceCheckUtils]: 271: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,383 INFO L290 TraceCheckUtils]: 272: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,383 INFO L290 TraceCheckUtils]: 273: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,383 INFO L290 TraceCheckUtils]: 274: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,384 INFO L290 TraceCheckUtils]: 275: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,384 INFO L290 TraceCheckUtils]: 276: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,384 INFO L290 TraceCheckUtils]: 277: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,384 INFO L290 TraceCheckUtils]: 278: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,385 INFO L290 TraceCheckUtils]: 279: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,385 INFO L290 TraceCheckUtils]: 280: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,385 INFO L290 TraceCheckUtils]: 281: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,385 INFO L290 TraceCheckUtils]: 282: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,385 INFO L290 TraceCheckUtils]: 283: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,386 INFO L290 TraceCheckUtils]: 284: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,386 INFO L290 TraceCheckUtils]: 285: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,386 INFO L290 TraceCheckUtils]: 286: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,386 INFO L290 TraceCheckUtils]: 287: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,386 INFO L290 TraceCheckUtils]: 288: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,387 INFO L290 TraceCheckUtils]: 289: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,387 INFO L290 TraceCheckUtils]: 290: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,387 INFO L290 TraceCheckUtils]: 291: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,387 INFO L290 TraceCheckUtils]: 292: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,388 INFO L290 TraceCheckUtils]: 293: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,388 INFO L290 TraceCheckUtils]: 294: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,388 INFO L290 TraceCheckUtils]: 295: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,388 INFO L290 TraceCheckUtils]: 296: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,388 INFO L290 TraceCheckUtils]: 297: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,389 INFO L290 TraceCheckUtils]: 298: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,389 INFO L290 TraceCheckUtils]: 299: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,389 INFO L290 TraceCheckUtils]: 300: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,389 INFO L290 TraceCheckUtils]: 301: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,389 INFO L290 TraceCheckUtils]: 302: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,390 INFO L290 TraceCheckUtils]: 303: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,390 INFO L290 TraceCheckUtils]: 304: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,390 INFO L290 TraceCheckUtils]: 305: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,390 INFO L290 TraceCheckUtils]: 306: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,390 INFO L290 TraceCheckUtils]: 307: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,391 INFO L290 TraceCheckUtils]: 308: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,391 INFO L290 TraceCheckUtils]: 309: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,391 INFO L290 TraceCheckUtils]: 310: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,391 INFO L290 TraceCheckUtils]: 311: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,392 INFO L290 TraceCheckUtils]: 312: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,392 INFO L290 TraceCheckUtils]: 313: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,392 INFO L290 TraceCheckUtils]: 314: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,392 INFO L290 TraceCheckUtils]: 315: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,392 INFO L290 TraceCheckUtils]: 316: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,393 INFO L290 TraceCheckUtils]: 317: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,393 INFO L290 TraceCheckUtils]: 318: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,393 INFO L290 TraceCheckUtils]: 319: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,393 INFO L290 TraceCheckUtils]: 320: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,393 INFO L290 TraceCheckUtils]: 321: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,394 INFO L290 TraceCheckUtils]: 322: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,394 INFO L290 TraceCheckUtils]: 323: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,394 INFO L290 TraceCheckUtils]: 324: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,394 INFO L290 TraceCheckUtils]: 325: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,394 INFO L290 TraceCheckUtils]: 326: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,395 INFO L290 TraceCheckUtils]: 327: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,395 INFO L290 TraceCheckUtils]: 328: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,395 INFO L290 TraceCheckUtils]: 329: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,395 INFO L290 TraceCheckUtils]: 330: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,396 INFO L290 TraceCheckUtils]: 331: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,396 INFO L290 TraceCheckUtils]: 332: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,396 INFO L290 TraceCheckUtils]: 333: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,396 INFO L290 TraceCheckUtils]: 334: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,396 INFO L290 TraceCheckUtils]: 335: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,397 INFO L290 TraceCheckUtils]: 336: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,397 INFO L290 TraceCheckUtils]: 337: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,397 INFO L290 TraceCheckUtils]: 338: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:45,397 INFO L290 TraceCheckUtils]: 339: Hoare triple {53667#(<= 20 main_~edgecount~0)} ~i~0 := 0; {53668#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:45,398 INFO L290 TraceCheckUtils]: 340: Hoare triple {53668#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {53668#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:45,398 INFO L290 TraceCheckUtils]: 341: Hoare triple {53668#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {53668#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:45,398 INFO L290 TraceCheckUtils]: 342: Hoare triple {53668#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {53669#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 03:36:45,399 INFO L290 TraceCheckUtils]: 343: Hoare triple {53669#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {53669#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 03:36:45,399 INFO L290 TraceCheckUtils]: 344: Hoare triple {53669#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {53669#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 03:36:45,399 INFO L290 TraceCheckUtils]: 345: Hoare triple {53669#(<= (+ 19 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {53670#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:36:45,400 INFO L290 TraceCheckUtils]: 346: Hoare triple {53670#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {53670#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:36:45,400 INFO L290 TraceCheckUtils]: 347: Hoare triple {53670#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {53670#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:36:45,400 INFO L290 TraceCheckUtils]: 348: Hoare triple {53670#(<= (+ main_~i~0 18) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {53671#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:36:45,400 INFO L290 TraceCheckUtils]: 349: Hoare triple {53671#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {53671#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:36:45,401 INFO L290 TraceCheckUtils]: 350: Hoare triple {53671#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {53671#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:36:45,401 INFO L290 TraceCheckUtils]: 351: Hoare triple {53671#(<= (+ main_~i~0 17) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {53672#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:36:45,401 INFO L290 TraceCheckUtils]: 352: Hoare triple {53672#(<= (+ main_~i~0 16) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {53672#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:36:45,401 INFO L290 TraceCheckUtils]: 353: Hoare triple {53672#(<= (+ main_~i~0 16) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {53672#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:36:45,402 INFO L290 TraceCheckUtils]: 354: Hoare triple {53672#(<= (+ main_~i~0 16) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {53673#(<= (+ main_~i~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:36:45,402 INFO L290 TraceCheckUtils]: 355: Hoare triple {53673#(<= (+ main_~i~0 15) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {53663#false} is VALID [2022-04-08 03:36:45,402 INFO L290 TraceCheckUtils]: 356: Hoare triple {53663#false} ~i~0 := 0; {53663#false} is VALID [2022-04-08 03:36:45,402 INFO L290 TraceCheckUtils]: 357: Hoare triple {53663#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53663#false} is VALID [2022-04-08 03:36:45,402 INFO L272 TraceCheckUtils]: 358: Hoare triple {53663#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {53663#false} is VALID [2022-04-08 03:36:45,402 INFO L290 TraceCheckUtils]: 359: Hoare triple {53663#false} ~cond := #in~cond; {53663#false} is VALID [2022-04-08 03:36:45,402 INFO L290 TraceCheckUtils]: 360: Hoare triple {53663#false} assume 0 == ~cond; {53663#false} is VALID [2022-04-08 03:36:45,402 INFO L290 TraceCheckUtils]: 361: Hoare triple {53663#false} assume !false; {53663#false} is VALID [2022-04-08 03:36:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 15455 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 03:36:45,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:36:45,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692579229] [2022-04-08 03:36:45,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692579229] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:36:45,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517452691] [2022-04-08 03:36:45,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:36:45,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:36:45,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:36:45,404 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:36:45,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-08 03:36:46,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:36:46,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:36:46,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 2193 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 03:36:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:46,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:36:47,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {53662#true} call ULTIMATE.init(); {53662#true} is VALID [2022-04-08 03:36:47,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {53662#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {53662#true} is VALID [2022-04-08 03:36:47,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {53662#true} assume true; {53662#true} is VALID [2022-04-08 03:36:47,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53662#true} {53662#true} #107#return; {53662#true} is VALID [2022-04-08 03:36:47,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {53662#true} call #t~ret22 := main(); {53662#true} is VALID [2022-04-08 03:36:47,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {53662#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {53667#(<= 20 main_~edgecount~0)} ~i~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,330 INFO L290 TraceCheckUtils]: 32: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,331 INFO L290 TraceCheckUtils]: 35: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,331 INFO L290 TraceCheckUtils]: 36: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,332 INFO L290 TraceCheckUtils]: 37: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,332 INFO L290 TraceCheckUtils]: 38: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,332 INFO L290 TraceCheckUtils]: 39: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,332 INFO L290 TraceCheckUtils]: 40: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,333 INFO L290 TraceCheckUtils]: 41: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,333 INFO L290 TraceCheckUtils]: 42: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,333 INFO L290 TraceCheckUtils]: 43: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,333 INFO L290 TraceCheckUtils]: 44: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,333 INFO L290 TraceCheckUtils]: 45: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,334 INFO L290 TraceCheckUtils]: 47: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,334 INFO L290 TraceCheckUtils]: 49: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,335 INFO L290 TraceCheckUtils]: 50: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,335 INFO L290 TraceCheckUtils]: 51: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,335 INFO L290 TraceCheckUtils]: 52: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,335 INFO L290 TraceCheckUtils]: 53: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,336 INFO L290 TraceCheckUtils]: 54: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,336 INFO L290 TraceCheckUtils]: 55: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,336 INFO L290 TraceCheckUtils]: 56: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,337 INFO L290 TraceCheckUtils]: 58: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,337 INFO L290 TraceCheckUtils]: 59: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,337 INFO L290 TraceCheckUtils]: 60: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,337 INFO L290 TraceCheckUtils]: 61: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,338 INFO L290 TraceCheckUtils]: 62: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,338 INFO L290 TraceCheckUtils]: 63: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,338 INFO L290 TraceCheckUtils]: 64: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,338 INFO L290 TraceCheckUtils]: 65: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,338 INFO L290 TraceCheckUtils]: 66: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,339 INFO L290 TraceCheckUtils]: 67: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,339 INFO L290 TraceCheckUtils]: 68: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,339 INFO L290 TraceCheckUtils]: 69: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,339 INFO L290 TraceCheckUtils]: 70: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,340 INFO L290 TraceCheckUtils]: 71: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,340 INFO L290 TraceCheckUtils]: 72: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,340 INFO L290 TraceCheckUtils]: 73: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,340 INFO L290 TraceCheckUtils]: 74: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,341 INFO L290 TraceCheckUtils]: 75: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,341 INFO L290 TraceCheckUtils]: 76: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,341 INFO L290 TraceCheckUtils]: 77: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,341 INFO L290 TraceCheckUtils]: 78: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,342 INFO L290 TraceCheckUtils]: 79: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,342 INFO L290 TraceCheckUtils]: 80: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,342 INFO L290 TraceCheckUtils]: 81: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,342 INFO L290 TraceCheckUtils]: 82: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,343 INFO L290 TraceCheckUtils]: 83: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,343 INFO L290 TraceCheckUtils]: 84: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,343 INFO L290 TraceCheckUtils]: 85: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,343 INFO L290 TraceCheckUtils]: 86: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,344 INFO L290 TraceCheckUtils]: 87: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,344 INFO L290 TraceCheckUtils]: 88: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,344 INFO L290 TraceCheckUtils]: 89: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,344 INFO L290 TraceCheckUtils]: 90: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,345 INFO L290 TraceCheckUtils]: 91: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,345 INFO L290 TraceCheckUtils]: 92: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,345 INFO L290 TraceCheckUtils]: 93: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,345 INFO L290 TraceCheckUtils]: 94: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,346 INFO L290 TraceCheckUtils]: 95: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,346 INFO L290 TraceCheckUtils]: 96: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,346 INFO L290 TraceCheckUtils]: 97: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,346 INFO L290 TraceCheckUtils]: 98: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,347 INFO L290 TraceCheckUtils]: 99: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,347 INFO L290 TraceCheckUtils]: 100: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,347 INFO L290 TraceCheckUtils]: 101: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,347 INFO L290 TraceCheckUtils]: 102: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,347 INFO L290 TraceCheckUtils]: 103: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,348 INFO L290 TraceCheckUtils]: 104: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,348 INFO L290 TraceCheckUtils]: 105: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,348 INFO L290 TraceCheckUtils]: 106: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,348 INFO L290 TraceCheckUtils]: 107: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,349 INFO L290 TraceCheckUtils]: 108: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,349 INFO L290 TraceCheckUtils]: 109: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,349 INFO L290 TraceCheckUtils]: 110: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,349 INFO L290 TraceCheckUtils]: 111: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,350 INFO L290 TraceCheckUtils]: 112: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,350 INFO L290 TraceCheckUtils]: 113: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,350 INFO L290 TraceCheckUtils]: 114: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,350 INFO L290 TraceCheckUtils]: 115: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,351 INFO L290 TraceCheckUtils]: 116: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,351 INFO L290 TraceCheckUtils]: 117: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,351 INFO L290 TraceCheckUtils]: 118: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,351 INFO L290 TraceCheckUtils]: 119: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,352 INFO L290 TraceCheckUtils]: 120: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,352 INFO L290 TraceCheckUtils]: 121: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,352 INFO L290 TraceCheckUtils]: 122: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,352 INFO L290 TraceCheckUtils]: 123: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,352 INFO L290 TraceCheckUtils]: 124: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,353 INFO L290 TraceCheckUtils]: 125: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,353 INFO L290 TraceCheckUtils]: 126: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,353 INFO L290 TraceCheckUtils]: 127: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,353 INFO L290 TraceCheckUtils]: 128: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,354 INFO L290 TraceCheckUtils]: 129: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,354 INFO L290 TraceCheckUtils]: 130: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,354 INFO L290 TraceCheckUtils]: 131: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,354 INFO L290 TraceCheckUtils]: 132: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,355 INFO L290 TraceCheckUtils]: 133: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,355 INFO L290 TraceCheckUtils]: 134: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,355 INFO L290 TraceCheckUtils]: 135: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,355 INFO L290 TraceCheckUtils]: 136: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,356 INFO L290 TraceCheckUtils]: 137: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,356 INFO L290 TraceCheckUtils]: 138: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,356 INFO L290 TraceCheckUtils]: 139: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,356 INFO L290 TraceCheckUtils]: 140: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,357 INFO L290 TraceCheckUtils]: 141: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,357 INFO L290 TraceCheckUtils]: 142: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,357 INFO L290 TraceCheckUtils]: 143: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,357 INFO L290 TraceCheckUtils]: 144: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,357 INFO L290 TraceCheckUtils]: 145: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,358 INFO L290 TraceCheckUtils]: 146: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,358 INFO L290 TraceCheckUtils]: 147: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,358 INFO L290 TraceCheckUtils]: 148: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,358 INFO L290 TraceCheckUtils]: 149: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,359 INFO L290 TraceCheckUtils]: 150: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,359 INFO L290 TraceCheckUtils]: 151: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,359 INFO L290 TraceCheckUtils]: 152: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,359 INFO L290 TraceCheckUtils]: 153: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,360 INFO L290 TraceCheckUtils]: 154: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,360 INFO L290 TraceCheckUtils]: 155: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,360 INFO L290 TraceCheckUtils]: 156: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,360 INFO L290 TraceCheckUtils]: 157: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,360 INFO L290 TraceCheckUtils]: 158: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,361 INFO L290 TraceCheckUtils]: 159: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,361 INFO L290 TraceCheckUtils]: 160: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,361 INFO L290 TraceCheckUtils]: 161: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,361 INFO L290 TraceCheckUtils]: 162: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,362 INFO L290 TraceCheckUtils]: 163: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,362 INFO L290 TraceCheckUtils]: 164: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,362 INFO L290 TraceCheckUtils]: 165: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,362 INFO L290 TraceCheckUtils]: 166: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,363 INFO L290 TraceCheckUtils]: 167: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,363 INFO L290 TraceCheckUtils]: 168: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,363 INFO L290 TraceCheckUtils]: 169: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,363 INFO L290 TraceCheckUtils]: 170: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,364 INFO L290 TraceCheckUtils]: 171: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,364 INFO L290 TraceCheckUtils]: 172: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,364 INFO L290 TraceCheckUtils]: 173: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,364 INFO L290 TraceCheckUtils]: 174: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,365 INFO L290 TraceCheckUtils]: 175: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,365 INFO L290 TraceCheckUtils]: 176: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,365 INFO L290 TraceCheckUtils]: 177: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,365 INFO L290 TraceCheckUtils]: 178: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,365 INFO L290 TraceCheckUtils]: 179: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,366 INFO L290 TraceCheckUtils]: 180: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,366 INFO L290 TraceCheckUtils]: 181: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,366 INFO L290 TraceCheckUtils]: 182: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,366 INFO L290 TraceCheckUtils]: 183: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,367 INFO L290 TraceCheckUtils]: 184: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,367 INFO L290 TraceCheckUtils]: 185: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,367 INFO L290 TraceCheckUtils]: 186: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,367 INFO L290 TraceCheckUtils]: 187: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,368 INFO L290 TraceCheckUtils]: 188: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,368 INFO L290 TraceCheckUtils]: 189: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,368 INFO L290 TraceCheckUtils]: 190: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,368 INFO L290 TraceCheckUtils]: 191: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,369 INFO L290 TraceCheckUtils]: 192: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,369 INFO L290 TraceCheckUtils]: 193: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,369 INFO L290 TraceCheckUtils]: 194: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,369 INFO L290 TraceCheckUtils]: 195: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,369 INFO L290 TraceCheckUtils]: 196: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,370 INFO L290 TraceCheckUtils]: 197: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,370 INFO L290 TraceCheckUtils]: 198: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,370 INFO L290 TraceCheckUtils]: 199: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,370 INFO L290 TraceCheckUtils]: 200: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,371 INFO L290 TraceCheckUtils]: 201: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,371 INFO L290 TraceCheckUtils]: 202: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,371 INFO L290 TraceCheckUtils]: 203: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,371 INFO L290 TraceCheckUtils]: 204: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,372 INFO L290 TraceCheckUtils]: 205: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,372 INFO L290 TraceCheckUtils]: 206: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,372 INFO L290 TraceCheckUtils]: 207: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,372 INFO L290 TraceCheckUtils]: 208: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,373 INFO L290 TraceCheckUtils]: 209: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,373 INFO L290 TraceCheckUtils]: 210: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,373 INFO L290 TraceCheckUtils]: 211: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,373 INFO L290 TraceCheckUtils]: 212: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,373 INFO L290 TraceCheckUtils]: 213: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,374 INFO L290 TraceCheckUtils]: 214: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,374 INFO L290 TraceCheckUtils]: 215: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,374 INFO L290 TraceCheckUtils]: 216: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,374 INFO L290 TraceCheckUtils]: 217: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,375 INFO L290 TraceCheckUtils]: 218: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,375 INFO L290 TraceCheckUtils]: 219: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,375 INFO L290 TraceCheckUtils]: 220: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,375 INFO L290 TraceCheckUtils]: 221: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,376 INFO L290 TraceCheckUtils]: 222: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,376 INFO L290 TraceCheckUtils]: 223: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,376 INFO L290 TraceCheckUtils]: 224: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,376 INFO L290 TraceCheckUtils]: 225: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,377 INFO L290 TraceCheckUtils]: 226: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,377 INFO L290 TraceCheckUtils]: 227: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,377 INFO L290 TraceCheckUtils]: 228: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,377 INFO L290 TraceCheckUtils]: 229: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,377 INFO L290 TraceCheckUtils]: 230: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,378 INFO L290 TraceCheckUtils]: 231: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,378 INFO L290 TraceCheckUtils]: 232: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,378 INFO L290 TraceCheckUtils]: 233: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,378 INFO L290 TraceCheckUtils]: 234: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,379 INFO L290 TraceCheckUtils]: 235: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,379 INFO L290 TraceCheckUtils]: 236: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,379 INFO L290 TraceCheckUtils]: 237: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,379 INFO L290 TraceCheckUtils]: 238: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,380 INFO L290 TraceCheckUtils]: 239: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,380 INFO L290 TraceCheckUtils]: 240: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,380 INFO L290 TraceCheckUtils]: 241: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,380 INFO L290 TraceCheckUtils]: 242: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,381 INFO L290 TraceCheckUtils]: 243: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,381 INFO L290 TraceCheckUtils]: 244: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,381 INFO L290 TraceCheckUtils]: 245: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,381 INFO L290 TraceCheckUtils]: 246: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,381 INFO L290 TraceCheckUtils]: 247: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,382 INFO L290 TraceCheckUtils]: 248: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,382 INFO L290 TraceCheckUtils]: 249: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,382 INFO L290 TraceCheckUtils]: 250: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,382 INFO L290 TraceCheckUtils]: 251: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,383 INFO L290 TraceCheckUtils]: 252: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,383 INFO L290 TraceCheckUtils]: 253: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,383 INFO L290 TraceCheckUtils]: 254: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,383 INFO L290 TraceCheckUtils]: 255: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,384 INFO L290 TraceCheckUtils]: 256: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,384 INFO L290 TraceCheckUtils]: 257: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,384 INFO L290 TraceCheckUtils]: 258: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,384 INFO L290 TraceCheckUtils]: 259: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,384 INFO L290 TraceCheckUtils]: 260: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,385 INFO L290 TraceCheckUtils]: 261: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,385 INFO L290 TraceCheckUtils]: 262: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,385 INFO L290 TraceCheckUtils]: 263: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,385 INFO L290 TraceCheckUtils]: 264: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,386 INFO L290 TraceCheckUtils]: 265: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,386 INFO L290 TraceCheckUtils]: 266: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,386 INFO L290 TraceCheckUtils]: 267: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,386 INFO L290 TraceCheckUtils]: 268: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,387 INFO L290 TraceCheckUtils]: 269: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,387 INFO L290 TraceCheckUtils]: 270: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,387 INFO L290 TraceCheckUtils]: 271: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,387 INFO L290 TraceCheckUtils]: 272: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,388 INFO L290 TraceCheckUtils]: 273: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,388 INFO L290 TraceCheckUtils]: 274: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,388 INFO L290 TraceCheckUtils]: 275: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,388 INFO L290 TraceCheckUtils]: 276: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,388 INFO L290 TraceCheckUtils]: 277: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,389 INFO L290 TraceCheckUtils]: 278: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,389 INFO L290 TraceCheckUtils]: 279: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,389 INFO L290 TraceCheckUtils]: 280: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,389 INFO L290 TraceCheckUtils]: 281: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,390 INFO L290 TraceCheckUtils]: 282: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,390 INFO L290 TraceCheckUtils]: 283: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,390 INFO L290 TraceCheckUtils]: 284: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,390 INFO L290 TraceCheckUtils]: 285: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,391 INFO L290 TraceCheckUtils]: 286: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,391 INFO L290 TraceCheckUtils]: 287: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,391 INFO L290 TraceCheckUtils]: 288: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,391 INFO L290 TraceCheckUtils]: 289: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,392 INFO L290 TraceCheckUtils]: 290: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,392 INFO L290 TraceCheckUtils]: 291: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,392 INFO L290 TraceCheckUtils]: 292: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,392 INFO L290 TraceCheckUtils]: 293: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,392 INFO L290 TraceCheckUtils]: 294: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,393 INFO L290 TraceCheckUtils]: 295: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,393 INFO L290 TraceCheckUtils]: 296: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,393 INFO L290 TraceCheckUtils]: 297: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,393 INFO L290 TraceCheckUtils]: 298: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,394 INFO L290 TraceCheckUtils]: 299: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,394 INFO L290 TraceCheckUtils]: 300: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,394 INFO L290 TraceCheckUtils]: 301: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,394 INFO L290 TraceCheckUtils]: 302: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,395 INFO L290 TraceCheckUtils]: 303: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,395 INFO L290 TraceCheckUtils]: 304: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,395 INFO L290 TraceCheckUtils]: 305: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,395 INFO L290 TraceCheckUtils]: 306: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,396 INFO L290 TraceCheckUtils]: 307: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,396 INFO L290 TraceCheckUtils]: 308: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,396 INFO L290 TraceCheckUtils]: 309: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,396 INFO L290 TraceCheckUtils]: 310: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,396 INFO L290 TraceCheckUtils]: 311: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,397 INFO L290 TraceCheckUtils]: 312: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,397 INFO L290 TraceCheckUtils]: 313: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,397 INFO L290 TraceCheckUtils]: 314: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,397 INFO L290 TraceCheckUtils]: 315: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,398 INFO L290 TraceCheckUtils]: 316: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,398 INFO L290 TraceCheckUtils]: 317: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,398 INFO L290 TraceCheckUtils]: 318: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,398 INFO L290 TraceCheckUtils]: 319: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,399 INFO L290 TraceCheckUtils]: 320: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,399 INFO L290 TraceCheckUtils]: 321: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,399 INFO L290 TraceCheckUtils]: 322: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,399 INFO L290 TraceCheckUtils]: 323: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,400 INFO L290 TraceCheckUtils]: 324: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,400 INFO L290 TraceCheckUtils]: 325: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,400 INFO L290 TraceCheckUtils]: 326: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,400 INFO L290 TraceCheckUtils]: 327: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,400 INFO L290 TraceCheckUtils]: 328: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,401 INFO L290 TraceCheckUtils]: 329: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,401 INFO L290 TraceCheckUtils]: 330: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,401 INFO L290 TraceCheckUtils]: 331: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,401 INFO L290 TraceCheckUtils]: 332: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,402 INFO L290 TraceCheckUtils]: 333: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,402 INFO L290 TraceCheckUtils]: 334: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,402 INFO L290 TraceCheckUtils]: 335: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,402 INFO L290 TraceCheckUtils]: 336: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,403 INFO L290 TraceCheckUtils]: 337: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,403 INFO L290 TraceCheckUtils]: 338: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:36:47,403 INFO L290 TraceCheckUtils]: 339: Hoare triple {53667#(<= 20 main_~edgecount~0)} ~i~0 := 0; {54695#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:47,404 INFO L290 TraceCheckUtils]: 340: Hoare triple {54695#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54695#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:47,404 INFO L290 TraceCheckUtils]: 341: Hoare triple {54695#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54695#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:47,404 INFO L290 TraceCheckUtils]: 342: Hoare triple {54695#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54705#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:47,405 INFO L290 TraceCheckUtils]: 343: Hoare triple {54705#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54705#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:47,405 INFO L290 TraceCheckUtils]: 344: Hoare triple {54705#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54705#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:47,405 INFO L290 TraceCheckUtils]: 345: Hoare triple {54705#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54715#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:47,406 INFO L290 TraceCheckUtils]: 346: Hoare triple {54715#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54715#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:47,406 INFO L290 TraceCheckUtils]: 347: Hoare triple {54715#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54715#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:47,407 INFO L290 TraceCheckUtils]: 348: Hoare triple {54715#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54725#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:47,407 INFO L290 TraceCheckUtils]: 349: Hoare triple {54725#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54725#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:47,407 INFO L290 TraceCheckUtils]: 350: Hoare triple {54725#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54725#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:47,408 INFO L290 TraceCheckUtils]: 351: Hoare triple {54725#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54735#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-08 03:36:47,408 INFO L290 TraceCheckUtils]: 352: Hoare triple {54735#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54735#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-08 03:36:47,408 INFO L290 TraceCheckUtils]: 353: Hoare triple {54735#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54735#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-08 03:36:47,409 INFO L290 TraceCheckUtils]: 354: Hoare triple {54735#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54745#(and (<= main_~i~0 5) (<= 20 main_~edgecount~0))} is VALID [2022-04-08 03:36:47,409 INFO L290 TraceCheckUtils]: 355: Hoare triple {54745#(and (<= main_~i~0 5) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {53663#false} is VALID [2022-04-08 03:36:47,409 INFO L290 TraceCheckUtils]: 356: Hoare triple {53663#false} ~i~0 := 0; {53663#false} is VALID [2022-04-08 03:36:47,409 INFO L290 TraceCheckUtils]: 357: Hoare triple {53663#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53663#false} is VALID [2022-04-08 03:36:47,409 INFO L272 TraceCheckUtils]: 358: Hoare triple {53663#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {53663#false} is VALID [2022-04-08 03:36:47,409 INFO L290 TraceCheckUtils]: 359: Hoare triple {53663#false} ~cond := #in~cond; {53663#false} is VALID [2022-04-08 03:36:47,409 INFO L290 TraceCheckUtils]: 360: Hoare triple {53663#false} assume 0 == ~cond; {53663#false} is VALID [2022-04-08 03:36:47,409 INFO L290 TraceCheckUtils]: 361: Hoare triple {53663#false} assume !false; {53663#false} is VALID [2022-04-08 03:36:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 15455 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 03:36:47,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:36:48,595 INFO L290 TraceCheckUtils]: 361: Hoare triple {53663#false} assume !false; {53663#false} is VALID [2022-04-08 03:36:48,595 INFO L290 TraceCheckUtils]: 360: Hoare triple {53663#false} assume 0 == ~cond; {53663#false} is VALID [2022-04-08 03:36:48,595 INFO L290 TraceCheckUtils]: 359: Hoare triple {53663#false} ~cond := #in~cond; {53663#false} is VALID [2022-04-08 03:36:48,595 INFO L272 TraceCheckUtils]: 358: Hoare triple {53663#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {53663#false} is VALID [2022-04-08 03:36:48,595 INFO L290 TraceCheckUtils]: 357: Hoare triple {53663#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53663#false} is VALID [2022-04-08 03:36:48,595 INFO L290 TraceCheckUtils]: 356: Hoare triple {53663#false} ~i~0 := 0; {53663#false} is VALID [2022-04-08 03:36:48,596 INFO L290 TraceCheckUtils]: 355: Hoare triple {54785#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {53663#false} is VALID [2022-04-08 03:36:48,596 INFO L290 TraceCheckUtils]: 354: Hoare triple {54789#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54785#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,596 INFO L290 TraceCheckUtils]: 353: Hoare triple {54789#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54789#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:48,597 INFO L290 TraceCheckUtils]: 352: Hoare triple {54789#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54789#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:48,597 INFO L290 TraceCheckUtils]: 351: Hoare triple {54799#(< (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54789#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:48,597 INFO L290 TraceCheckUtils]: 350: Hoare triple {54799#(< (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54799#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:36:48,598 INFO L290 TraceCheckUtils]: 349: Hoare triple {54799#(< (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54799#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:36:48,598 INFO L290 TraceCheckUtils]: 348: Hoare triple {54809#(< (+ main_~i~0 3) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54799#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:36:48,598 INFO L290 TraceCheckUtils]: 347: Hoare triple {54809#(< (+ main_~i~0 3) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54809#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:36:48,599 INFO L290 TraceCheckUtils]: 346: Hoare triple {54809#(< (+ main_~i~0 3) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54809#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:36:48,599 INFO L290 TraceCheckUtils]: 345: Hoare triple {54819#(< (+ main_~i~0 4) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54809#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:36:48,599 INFO L290 TraceCheckUtils]: 344: Hoare triple {54819#(< (+ main_~i~0 4) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54819#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:36:48,600 INFO L290 TraceCheckUtils]: 343: Hoare triple {54819#(< (+ main_~i~0 4) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54819#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:36:48,600 INFO L290 TraceCheckUtils]: 342: Hoare triple {54829#(< (+ 5 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54819#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:36:48,601 INFO L290 TraceCheckUtils]: 341: Hoare triple {54829#(< (+ 5 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54829#(< (+ 5 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 03:36:48,601 INFO L290 TraceCheckUtils]: 340: Hoare triple {54829#(< (+ 5 main_~i~0) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54829#(< (+ 5 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 03:36:48,601 INFO L290 TraceCheckUtils]: 339: Hoare triple {54839#(< 5 main_~edgecount~0)} ~i~0 := 0; {54829#(< (+ 5 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 03:36:48,602 INFO L290 TraceCheckUtils]: 338: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,602 INFO L290 TraceCheckUtils]: 337: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,602 INFO L290 TraceCheckUtils]: 336: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,602 INFO L290 TraceCheckUtils]: 335: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,603 INFO L290 TraceCheckUtils]: 334: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,603 INFO L290 TraceCheckUtils]: 333: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,603 INFO L290 TraceCheckUtils]: 332: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,603 INFO L290 TraceCheckUtils]: 331: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,604 INFO L290 TraceCheckUtils]: 330: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,604 INFO L290 TraceCheckUtils]: 329: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,604 INFO L290 TraceCheckUtils]: 328: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,604 INFO L290 TraceCheckUtils]: 327: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,605 INFO L290 TraceCheckUtils]: 326: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,605 INFO L290 TraceCheckUtils]: 325: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,605 INFO L290 TraceCheckUtils]: 324: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,605 INFO L290 TraceCheckUtils]: 323: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,606 INFO L290 TraceCheckUtils]: 322: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,606 INFO L290 TraceCheckUtils]: 321: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,606 INFO L290 TraceCheckUtils]: 320: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,606 INFO L290 TraceCheckUtils]: 319: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,607 INFO L290 TraceCheckUtils]: 318: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,607 INFO L290 TraceCheckUtils]: 317: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,607 INFO L290 TraceCheckUtils]: 316: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,607 INFO L290 TraceCheckUtils]: 315: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,608 INFO L290 TraceCheckUtils]: 314: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,608 INFO L290 TraceCheckUtils]: 313: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,608 INFO L290 TraceCheckUtils]: 312: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,608 INFO L290 TraceCheckUtils]: 311: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,609 INFO L290 TraceCheckUtils]: 310: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,609 INFO L290 TraceCheckUtils]: 309: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,609 INFO L290 TraceCheckUtils]: 308: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,609 INFO L290 TraceCheckUtils]: 307: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,609 INFO L290 TraceCheckUtils]: 306: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,610 INFO L290 TraceCheckUtils]: 305: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,610 INFO L290 TraceCheckUtils]: 304: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,610 INFO L290 TraceCheckUtils]: 303: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,610 INFO L290 TraceCheckUtils]: 302: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,611 INFO L290 TraceCheckUtils]: 301: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,611 INFO L290 TraceCheckUtils]: 300: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,611 INFO L290 TraceCheckUtils]: 299: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,611 INFO L290 TraceCheckUtils]: 298: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,612 INFO L290 TraceCheckUtils]: 297: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,612 INFO L290 TraceCheckUtils]: 296: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,612 INFO L290 TraceCheckUtils]: 295: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,612 INFO L290 TraceCheckUtils]: 294: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,613 INFO L290 TraceCheckUtils]: 293: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,613 INFO L290 TraceCheckUtils]: 292: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,613 INFO L290 TraceCheckUtils]: 291: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,613 INFO L290 TraceCheckUtils]: 290: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,614 INFO L290 TraceCheckUtils]: 289: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,614 INFO L290 TraceCheckUtils]: 288: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,614 INFO L290 TraceCheckUtils]: 287: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,614 INFO L290 TraceCheckUtils]: 286: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,614 INFO L290 TraceCheckUtils]: 285: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,615 INFO L290 TraceCheckUtils]: 284: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,615 INFO L290 TraceCheckUtils]: 283: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,615 INFO L290 TraceCheckUtils]: 282: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,615 INFO L290 TraceCheckUtils]: 281: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,616 INFO L290 TraceCheckUtils]: 280: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,616 INFO L290 TraceCheckUtils]: 279: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,616 INFO L290 TraceCheckUtils]: 278: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,616 INFO L290 TraceCheckUtils]: 277: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,617 INFO L290 TraceCheckUtils]: 276: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,617 INFO L290 TraceCheckUtils]: 275: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,617 INFO L290 TraceCheckUtils]: 274: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,617 INFO L290 TraceCheckUtils]: 273: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,618 INFO L290 TraceCheckUtils]: 272: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,618 INFO L290 TraceCheckUtils]: 271: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,618 INFO L290 TraceCheckUtils]: 270: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,618 INFO L290 TraceCheckUtils]: 269: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,618 INFO L290 TraceCheckUtils]: 268: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,619 INFO L290 TraceCheckUtils]: 267: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,619 INFO L290 TraceCheckUtils]: 266: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,619 INFO L290 TraceCheckUtils]: 265: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,619 INFO L290 TraceCheckUtils]: 264: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,620 INFO L290 TraceCheckUtils]: 263: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,620 INFO L290 TraceCheckUtils]: 262: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,620 INFO L290 TraceCheckUtils]: 261: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,620 INFO L290 TraceCheckUtils]: 260: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,621 INFO L290 TraceCheckUtils]: 259: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,621 INFO L290 TraceCheckUtils]: 258: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,621 INFO L290 TraceCheckUtils]: 257: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,621 INFO L290 TraceCheckUtils]: 256: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,622 INFO L290 TraceCheckUtils]: 255: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,622 INFO L290 TraceCheckUtils]: 254: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,622 INFO L290 TraceCheckUtils]: 253: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,622 INFO L290 TraceCheckUtils]: 252: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,622 INFO L290 TraceCheckUtils]: 251: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,623 INFO L290 TraceCheckUtils]: 250: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,623 INFO L290 TraceCheckUtils]: 249: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,623 INFO L290 TraceCheckUtils]: 248: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,623 INFO L290 TraceCheckUtils]: 247: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,624 INFO L290 TraceCheckUtils]: 246: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,624 INFO L290 TraceCheckUtils]: 245: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,624 INFO L290 TraceCheckUtils]: 244: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,624 INFO L290 TraceCheckUtils]: 243: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,625 INFO L290 TraceCheckUtils]: 242: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,625 INFO L290 TraceCheckUtils]: 241: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,625 INFO L290 TraceCheckUtils]: 240: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,625 INFO L290 TraceCheckUtils]: 239: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,626 INFO L290 TraceCheckUtils]: 238: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,626 INFO L290 TraceCheckUtils]: 237: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,626 INFO L290 TraceCheckUtils]: 236: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,626 INFO L290 TraceCheckUtils]: 235: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,627 INFO L290 TraceCheckUtils]: 234: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,627 INFO L290 TraceCheckUtils]: 233: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,627 INFO L290 TraceCheckUtils]: 232: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,627 INFO L290 TraceCheckUtils]: 231: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,628 INFO L290 TraceCheckUtils]: 230: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,628 INFO L290 TraceCheckUtils]: 229: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,628 INFO L290 TraceCheckUtils]: 228: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,628 INFO L290 TraceCheckUtils]: 227: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,629 INFO L290 TraceCheckUtils]: 226: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,629 INFO L290 TraceCheckUtils]: 225: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,629 INFO L290 TraceCheckUtils]: 224: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,630 INFO L290 TraceCheckUtils]: 223: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,630 INFO L290 TraceCheckUtils]: 222: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,630 INFO L290 TraceCheckUtils]: 221: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,630 INFO L290 TraceCheckUtils]: 220: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,631 INFO L290 TraceCheckUtils]: 219: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,631 INFO L290 TraceCheckUtils]: 218: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,631 INFO L290 TraceCheckUtils]: 217: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,631 INFO L290 TraceCheckUtils]: 216: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,631 INFO L290 TraceCheckUtils]: 215: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,632 INFO L290 TraceCheckUtils]: 214: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,632 INFO L290 TraceCheckUtils]: 213: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,632 INFO L290 TraceCheckUtils]: 212: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,632 INFO L290 TraceCheckUtils]: 211: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,633 INFO L290 TraceCheckUtils]: 210: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,633 INFO L290 TraceCheckUtils]: 209: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,633 INFO L290 TraceCheckUtils]: 208: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,633 INFO L290 TraceCheckUtils]: 207: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,634 INFO L290 TraceCheckUtils]: 206: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,634 INFO L290 TraceCheckUtils]: 205: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,634 INFO L290 TraceCheckUtils]: 204: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,634 INFO L290 TraceCheckUtils]: 203: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,635 INFO L290 TraceCheckUtils]: 202: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,635 INFO L290 TraceCheckUtils]: 201: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,635 INFO L290 TraceCheckUtils]: 200: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,635 INFO L290 TraceCheckUtils]: 199: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,636 INFO L290 TraceCheckUtils]: 198: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,636 INFO L290 TraceCheckUtils]: 197: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,636 INFO L290 TraceCheckUtils]: 196: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,636 INFO L290 TraceCheckUtils]: 195: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,637 INFO L290 TraceCheckUtils]: 194: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,637 INFO L290 TraceCheckUtils]: 193: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,637 INFO L290 TraceCheckUtils]: 192: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,637 INFO L290 TraceCheckUtils]: 191: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,637 INFO L290 TraceCheckUtils]: 190: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,638 INFO L290 TraceCheckUtils]: 189: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,638 INFO L290 TraceCheckUtils]: 188: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,638 INFO L290 TraceCheckUtils]: 187: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,638 INFO L290 TraceCheckUtils]: 186: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,639 INFO L290 TraceCheckUtils]: 185: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,639 INFO L290 TraceCheckUtils]: 184: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,639 INFO L290 TraceCheckUtils]: 183: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,639 INFO L290 TraceCheckUtils]: 182: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,640 INFO L290 TraceCheckUtils]: 181: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,640 INFO L290 TraceCheckUtils]: 180: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,640 INFO L290 TraceCheckUtils]: 179: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,640 INFO L290 TraceCheckUtils]: 178: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,641 INFO L290 TraceCheckUtils]: 177: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,641 INFO L290 TraceCheckUtils]: 176: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,641 INFO L290 TraceCheckUtils]: 175: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,641 INFO L290 TraceCheckUtils]: 174: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,642 INFO L290 TraceCheckUtils]: 173: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,642 INFO L290 TraceCheckUtils]: 172: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,642 INFO L290 TraceCheckUtils]: 171: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,642 INFO L290 TraceCheckUtils]: 170: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,643 INFO L290 TraceCheckUtils]: 169: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,643 INFO L290 TraceCheckUtils]: 168: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,643 INFO L290 TraceCheckUtils]: 167: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,643 INFO L290 TraceCheckUtils]: 166: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,643 INFO L290 TraceCheckUtils]: 165: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,644 INFO L290 TraceCheckUtils]: 164: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,644 INFO L290 TraceCheckUtils]: 163: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,644 INFO L290 TraceCheckUtils]: 162: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,644 INFO L290 TraceCheckUtils]: 161: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,645 INFO L290 TraceCheckUtils]: 160: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,645 INFO L290 TraceCheckUtils]: 159: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,645 INFO L290 TraceCheckUtils]: 158: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,645 INFO L290 TraceCheckUtils]: 157: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,646 INFO L290 TraceCheckUtils]: 156: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,646 INFO L290 TraceCheckUtils]: 155: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,646 INFO L290 TraceCheckUtils]: 154: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,646 INFO L290 TraceCheckUtils]: 153: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,647 INFO L290 TraceCheckUtils]: 152: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,647 INFO L290 TraceCheckUtils]: 151: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,647 INFO L290 TraceCheckUtils]: 150: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,647 INFO L290 TraceCheckUtils]: 149: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,647 INFO L290 TraceCheckUtils]: 148: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,648 INFO L290 TraceCheckUtils]: 147: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,648 INFO L290 TraceCheckUtils]: 146: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,648 INFO L290 TraceCheckUtils]: 145: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,648 INFO L290 TraceCheckUtils]: 144: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,649 INFO L290 TraceCheckUtils]: 143: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,649 INFO L290 TraceCheckUtils]: 142: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,649 INFO L290 TraceCheckUtils]: 141: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,649 INFO L290 TraceCheckUtils]: 140: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,650 INFO L290 TraceCheckUtils]: 139: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,650 INFO L290 TraceCheckUtils]: 138: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,650 INFO L290 TraceCheckUtils]: 137: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,650 INFO L290 TraceCheckUtils]: 136: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,651 INFO L290 TraceCheckUtils]: 135: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,651 INFO L290 TraceCheckUtils]: 134: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,651 INFO L290 TraceCheckUtils]: 133: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,651 INFO L290 TraceCheckUtils]: 132: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,651 INFO L290 TraceCheckUtils]: 131: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,652 INFO L290 TraceCheckUtils]: 130: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,652 INFO L290 TraceCheckUtils]: 129: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,652 INFO L290 TraceCheckUtils]: 128: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,652 INFO L290 TraceCheckUtils]: 127: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,653 INFO L290 TraceCheckUtils]: 126: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,653 INFO L290 TraceCheckUtils]: 125: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,653 INFO L290 TraceCheckUtils]: 124: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,653 INFO L290 TraceCheckUtils]: 123: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,654 INFO L290 TraceCheckUtils]: 122: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,654 INFO L290 TraceCheckUtils]: 121: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,654 INFO L290 TraceCheckUtils]: 120: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,654 INFO L290 TraceCheckUtils]: 119: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,655 INFO L290 TraceCheckUtils]: 118: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,655 INFO L290 TraceCheckUtils]: 117: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,655 INFO L290 TraceCheckUtils]: 116: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,655 INFO L290 TraceCheckUtils]: 115: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,655 INFO L290 TraceCheckUtils]: 114: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,656 INFO L290 TraceCheckUtils]: 113: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,656 INFO L290 TraceCheckUtils]: 112: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,656 INFO L290 TraceCheckUtils]: 111: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,656 INFO L290 TraceCheckUtils]: 110: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,657 INFO L290 TraceCheckUtils]: 109: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,657 INFO L290 TraceCheckUtils]: 108: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,657 INFO L290 TraceCheckUtils]: 107: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,657 INFO L290 TraceCheckUtils]: 106: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,658 INFO L290 TraceCheckUtils]: 105: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,658 INFO L290 TraceCheckUtils]: 104: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,658 INFO L290 TraceCheckUtils]: 103: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,658 INFO L290 TraceCheckUtils]: 102: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,659 INFO L290 TraceCheckUtils]: 101: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,659 INFO L290 TraceCheckUtils]: 100: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,659 INFO L290 TraceCheckUtils]: 99: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,659 INFO L290 TraceCheckUtils]: 98: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,660 INFO L290 TraceCheckUtils]: 97: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,660 INFO L290 TraceCheckUtils]: 96: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,660 INFO L290 TraceCheckUtils]: 95: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,660 INFO L290 TraceCheckUtils]: 94: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,660 INFO L290 TraceCheckUtils]: 93: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,661 INFO L290 TraceCheckUtils]: 92: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,661 INFO L290 TraceCheckUtils]: 91: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,661 INFO L290 TraceCheckUtils]: 90: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,661 INFO L290 TraceCheckUtils]: 89: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,662 INFO L290 TraceCheckUtils]: 88: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,662 INFO L290 TraceCheckUtils]: 87: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,662 INFO L290 TraceCheckUtils]: 86: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,662 INFO L290 TraceCheckUtils]: 85: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,663 INFO L290 TraceCheckUtils]: 84: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,663 INFO L290 TraceCheckUtils]: 83: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,663 INFO L290 TraceCheckUtils]: 82: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,663 INFO L290 TraceCheckUtils]: 81: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,664 INFO L290 TraceCheckUtils]: 80: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,664 INFO L290 TraceCheckUtils]: 79: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,664 INFO L290 TraceCheckUtils]: 78: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,664 INFO L290 TraceCheckUtils]: 77: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,664 INFO L290 TraceCheckUtils]: 76: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,665 INFO L290 TraceCheckUtils]: 75: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,665 INFO L290 TraceCheckUtils]: 74: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,665 INFO L290 TraceCheckUtils]: 73: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,666 INFO L290 TraceCheckUtils]: 72: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,666 INFO L290 TraceCheckUtils]: 71: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,666 INFO L290 TraceCheckUtils]: 70: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,666 INFO L290 TraceCheckUtils]: 69: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,667 INFO L290 TraceCheckUtils]: 68: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,667 INFO L290 TraceCheckUtils]: 67: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,667 INFO L290 TraceCheckUtils]: 66: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,667 INFO L290 TraceCheckUtils]: 65: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,668 INFO L290 TraceCheckUtils]: 64: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,668 INFO L290 TraceCheckUtils]: 63: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,668 INFO L290 TraceCheckUtils]: 62: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,669 INFO L290 TraceCheckUtils]: 61: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,669 INFO L290 TraceCheckUtils]: 60: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,669 INFO L290 TraceCheckUtils]: 59: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,669 INFO L290 TraceCheckUtils]: 58: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,670 INFO L290 TraceCheckUtils]: 57: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,670 INFO L290 TraceCheckUtils]: 56: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,670 INFO L290 TraceCheckUtils]: 55: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,671 INFO L290 TraceCheckUtils]: 53: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,671 INFO L290 TraceCheckUtils]: 52: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,671 INFO L290 TraceCheckUtils]: 51: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,672 INFO L290 TraceCheckUtils]: 50: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,672 INFO L290 TraceCheckUtils]: 49: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,672 INFO L290 TraceCheckUtils]: 48: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,672 INFO L290 TraceCheckUtils]: 47: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,673 INFO L290 TraceCheckUtils]: 46: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,673 INFO L290 TraceCheckUtils]: 45: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,673 INFO L290 TraceCheckUtils]: 43: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,674 INFO L290 TraceCheckUtils]: 41: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,674 INFO L290 TraceCheckUtils]: 40: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,674 INFO L290 TraceCheckUtils]: 39: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {54839#(< 5 main_~edgecount~0)} ~i~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {54839#(< 5 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {53662#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-08 03:36:48,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {53662#true} call #t~ret22 := main(); {53662#true} is VALID [2022-04-08 03:36:48,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53662#true} {53662#true} #107#return; {53662#true} is VALID [2022-04-08 03:36:48,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {53662#true} assume true; {53662#true} is VALID [2022-04-08 03:36:48,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {53662#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {53662#true} is VALID [2022-04-08 03:36:48,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {53662#true} call ULTIMATE.init(); {53662#true} is VALID [2022-04-08 03:36:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15455 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 03:36:48,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517452691] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:36:48,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:36:48,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2022-04-08 03:36:48,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:36:48,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [667095240] [2022-04-08 03:36:48,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [667095240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:36:48,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:36:48,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 03:36:48,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203076550] [2022-04-08 03:36:48,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:36:48,695 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 362 [2022-04-08 03:36:48,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:36:48,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:48,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:48,727 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 03:36:48,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:48,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 03:36:48,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=305, Unknown=0, NotChecked=0, Total=506 [2022-04-08 03:36:48,728 INFO L87 Difference]: Start difference. First operand 367 states and 476 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:51,655 INFO L93 Difference]: Finished difference Result 539 states and 699 transitions. [2022-04-08 03:36:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 03:36:51,655 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 362 [2022-04-08 03:36:51,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:36:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2022-04-08 03:36:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2022-04-08 03:36:51,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 160 transitions. [2022-04-08 03:36:51,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:51,784 INFO L225 Difference]: With dead ends: 539 [2022-04-08 03:36:51,784 INFO L226 Difference]: Without dead ends: 528 [2022-04-08 03:36:51,784 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 713 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=320, Invalid=550, Unknown=0, NotChecked=0, Total=870 [2022-04-08 03:36:51,784 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 242 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:36:51,785 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 47 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:36:51,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-04-08 03:36:53,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 370. [2022-04-08 03:36:53,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:36:53,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 528 states. Second operand has 370 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 364 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:53,480 INFO L74 IsIncluded]: Start isIncluded. First operand 528 states. Second operand has 370 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 364 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:53,480 INFO L87 Difference]: Start difference. First operand 528 states. Second operand has 370 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 364 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:53,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:53,492 INFO L93 Difference]: Finished difference Result 528 states and 687 transitions. [2022-04-08 03:36:53,492 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 687 transitions. [2022-04-08 03:36:53,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:53,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:53,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 370 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 364 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 528 states. [2022-04-08 03:36:53,494 INFO L87 Difference]: Start difference. First operand has 370 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 364 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 528 states. [2022-04-08 03:36:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:53,506 INFO L93 Difference]: Finished difference Result 528 states and 687 transitions. [2022-04-08 03:36:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 687 transitions. [2022-04-08 03:36:53,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:53,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:53,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:36:53,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:36:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 364 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 479 transitions. [2022-04-08 03:36:53,513 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 479 transitions. Word has length 362 [2022-04-08 03:36:53,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:36:53,513 INFO L478 AbstractCegarLoop]: Abstraction has 370 states and 479 transitions. [2022-04-08 03:36:53,513 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:53,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 370 states and 479 transitions. [2022-04-08 03:36:54,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:54,338 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 479 transitions. [2022-04-08 03:36:54,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2022-04-08 03:36:54,340 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:36:54,340 INFO L499 BasicCegarLoop]: trace histogram [100, 100, 100, 6, 6, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:36:54,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-08 03:36:54,554 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-08 03:36:54,555 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:36:54,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:36:54,555 INFO L85 PathProgramCache]: Analyzing trace with hash 952532282, now seen corresponding path program 63 times [2022-04-08 03:36:54,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:54,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1461298025] [2022-04-08 03:36:54,558 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:36:54,558 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:36:54,558 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:36:54,558 INFO L85 PathProgramCache]: Analyzing trace with hash 952532282, now seen corresponding path program 64 times [2022-04-08 03:36:54,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:36:54,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776485824] [2022-04-08 03:36:54,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:36:54,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:36:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:54,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:36:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:54,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {58760#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {58747#true} is VALID [2022-04-08 03:36:54,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {58747#true} assume true; {58747#true} is VALID [2022-04-08 03:36:54,902 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58747#true} {58747#true} #107#return; {58747#true} is VALID [2022-04-08 03:36:54,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {58747#true} call ULTIMATE.init(); {58760#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:36:54,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {58760#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {58747#true} is VALID [2022-04-08 03:36:54,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {58747#true} assume true; {58747#true} is VALID [2022-04-08 03:36:54,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58747#true} {58747#true} #107#return; {58747#true} is VALID [2022-04-08 03:36:54,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {58747#true} call #t~ret22 := main(); {58747#true} is VALID [2022-04-08 03:36:54,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {58747#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,912 INFO L290 TraceCheckUtils]: 42: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,913 INFO L290 TraceCheckUtils]: 45: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,913 INFO L290 TraceCheckUtils]: 46: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,914 INFO L290 TraceCheckUtils]: 47: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,914 INFO L290 TraceCheckUtils]: 48: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,914 INFO L290 TraceCheckUtils]: 49: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,914 INFO L290 TraceCheckUtils]: 50: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,915 INFO L290 TraceCheckUtils]: 51: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,915 INFO L290 TraceCheckUtils]: 52: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,915 INFO L290 TraceCheckUtils]: 53: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,915 INFO L290 TraceCheckUtils]: 54: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,915 INFO L290 TraceCheckUtils]: 55: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,916 INFO L290 TraceCheckUtils]: 56: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,916 INFO L290 TraceCheckUtils]: 57: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,916 INFO L290 TraceCheckUtils]: 58: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,916 INFO L290 TraceCheckUtils]: 59: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,917 INFO L290 TraceCheckUtils]: 60: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,917 INFO L290 TraceCheckUtils]: 61: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,917 INFO L290 TraceCheckUtils]: 62: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,917 INFO L290 TraceCheckUtils]: 63: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,918 INFO L290 TraceCheckUtils]: 64: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,918 INFO L290 TraceCheckUtils]: 65: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,918 INFO L290 TraceCheckUtils]: 66: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,918 INFO L290 TraceCheckUtils]: 67: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,919 INFO L290 TraceCheckUtils]: 68: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,919 INFO L290 TraceCheckUtils]: 69: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,919 INFO L290 TraceCheckUtils]: 70: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,919 INFO L290 TraceCheckUtils]: 71: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,920 INFO L290 TraceCheckUtils]: 72: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,920 INFO L290 TraceCheckUtils]: 73: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,920 INFO L290 TraceCheckUtils]: 74: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,920 INFO L290 TraceCheckUtils]: 75: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,927 INFO L290 TraceCheckUtils]: 76: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,928 INFO L290 TraceCheckUtils]: 77: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,928 INFO L290 TraceCheckUtils]: 78: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,928 INFO L290 TraceCheckUtils]: 79: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,928 INFO L290 TraceCheckUtils]: 80: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,928 INFO L290 TraceCheckUtils]: 81: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,929 INFO L290 TraceCheckUtils]: 82: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,929 INFO L290 TraceCheckUtils]: 83: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,929 INFO L290 TraceCheckUtils]: 84: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,930 INFO L290 TraceCheckUtils]: 85: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,930 INFO L290 TraceCheckUtils]: 86: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,930 INFO L290 TraceCheckUtils]: 87: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,930 INFO L290 TraceCheckUtils]: 88: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,930 INFO L290 TraceCheckUtils]: 89: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,931 INFO L290 TraceCheckUtils]: 90: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,931 INFO L290 TraceCheckUtils]: 91: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,931 INFO L290 TraceCheckUtils]: 92: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,932 INFO L290 TraceCheckUtils]: 93: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,932 INFO L290 TraceCheckUtils]: 94: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,932 INFO L290 TraceCheckUtils]: 95: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,932 INFO L290 TraceCheckUtils]: 96: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,933 INFO L290 TraceCheckUtils]: 97: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,933 INFO L290 TraceCheckUtils]: 98: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,933 INFO L290 TraceCheckUtils]: 99: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,933 INFO L290 TraceCheckUtils]: 100: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,934 INFO L290 TraceCheckUtils]: 101: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,934 INFO L290 TraceCheckUtils]: 102: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,934 INFO L290 TraceCheckUtils]: 103: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,934 INFO L290 TraceCheckUtils]: 104: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,935 INFO L290 TraceCheckUtils]: 105: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,935 INFO L290 TraceCheckUtils]: 106: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,935 INFO L290 TraceCheckUtils]: 107: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,935 INFO L290 TraceCheckUtils]: 108: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,936 INFO L290 TraceCheckUtils]: 109: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,936 INFO L290 TraceCheckUtils]: 110: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,936 INFO L290 TraceCheckUtils]: 111: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,936 INFO L290 TraceCheckUtils]: 112: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,937 INFO L290 TraceCheckUtils]: 113: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,937 INFO L290 TraceCheckUtils]: 114: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,937 INFO L290 TraceCheckUtils]: 115: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,937 INFO L290 TraceCheckUtils]: 116: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,938 INFO L290 TraceCheckUtils]: 117: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,938 INFO L290 TraceCheckUtils]: 118: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,938 INFO L290 TraceCheckUtils]: 119: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,938 INFO L290 TraceCheckUtils]: 120: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,939 INFO L290 TraceCheckUtils]: 121: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,939 INFO L290 TraceCheckUtils]: 122: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,939 INFO L290 TraceCheckUtils]: 123: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,939 INFO L290 TraceCheckUtils]: 124: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,940 INFO L290 TraceCheckUtils]: 125: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,940 INFO L290 TraceCheckUtils]: 126: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,940 INFO L290 TraceCheckUtils]: 127: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,940 INFO L290 TraceCheckUtils]: 128: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,941 INFO L290 TraceCheckUtils]: 129: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,941 INFO L290 TraceCheckUtils]: 130: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,941 INFO L290 TraceCheckUtils]: 131: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,942 INFO L290 TraceCheckUtils]: 132: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,942 INFO L290 TraceCheckUtils]: 133: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,942 INFO L290 TraceCheckUtils]: 134: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,942 INFO L290 TraceCheckUtils]: 135: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,943 INFO L290 TraceCheckUtils]: 136: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,943 INFO L290 TraceCheckUtils]: 137: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,943 INFO L290 TraceCheckUtils]: 138: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,943 INFO L290 TraceCheckUtils]: 139: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,944 INFO L290 TraceCheckUtils]: 140: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,944 INFO L290 TraceCheckUtils]: 141: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,944 INFO L290 TraceCheckUtils]: 142: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,944 INFO L290 TraceCheckUtils]: 143: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,945 INFO L290 TraceCheckUtils]: 144: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,945 INFO L290 TraceCheckUtils]: 145: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,945 INFO L290 TraceCheckUtils]: 146: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,945 INFO L290 TraceCheckUtils]: 147: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,946 INFO L290 TraceCheckUtils]: 148: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,946 INFO L290 TraceCheckUtils]: 149: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,946 INFO L290 TraceCheckUtils]: 150: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,946 INFO L290 TraceCheckUtils]: 151: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,947 INFO L290 TraceCheckUtils]: 152: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,947 INFO L290 TraceCheckUtils]: 153: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,948 INFO L290 TraceCheckUtils]: 154: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,949 INFO L290 TraceCheckUtils]: 155: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,949 INFO L290 TraceCheckUtils]: 156: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,949 INFO L290 TraceCheckUtils]: 157: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,950 INFO L290 TraceCheckUtils]: 158: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,950 INFO L290 TraceCheckUtils]: 159: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,950 INFO L290 TraceCheckUtils]: 160: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,950 INFO L290 TraceCheckUtils]: 161: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,951 INFO L290 TraceCheckUtils]: 162: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,951 INFO L290 TraceCheckUtils]: 163: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,951 INFO L290 TraceCheckUtils]: 164: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,951 INFO L290 TraceCheckUtils]: 165: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,952 INFO L290 TraceCheckUtils]: 166: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,952 INFO L290 TraceCheckUtils]: 167: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,952 INFO L290 TraceCheckUtils]: 168: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,952 INFO L290 TraceCheckUtils]: 169: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,953 INFO L290 TraceCheckUtils]: 170: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,953 INFO L290 TraceCheckUtils]: 171: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,953 INFO L290 TraceCheckUtils]: 172: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,954 INFO L290 TraceCheckUtils]: 173: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,954 INFO L290 TraceCheckUtils]: 174: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,955 INFO L290 TraceCheckUtils]: 175: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,955 INFO L290 TraceCheckUtils]: 176: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,955 INFO L290 TraceCheckUtils]: 177: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,956 INFO L290 TraceCheckUtils]: 178: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,956 INFO L290 TraceCheckUtils]: 179: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,971 INFO L290 TraceCheckUtils]: 180: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,971 INFO L290 TraceCheckUtils]: 181: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,972 INFO L290 TraceCheckUtils]: 182: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,972 INFO L290 TraceCheckUtils]: 183: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,972 INFO L290 TraceCheckUtils]: 184: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,972 INFO L290 TraceCheckUtils]: 185: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,973 INFO L290 TraceCheckUtils]: 186: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,973 INFO L290 TraceCheckUtils]: 187: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,973 INFO L290 TraceCheckUtils]: 188: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,973 INFO L290 TraceCheckUtils]: 189: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,974 INFO L290 TraceCheckUtils]: 190: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,974 INFO L290 TraceCheckUtils]: 191: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,974 INFO L290 TraceCheckUtils]: 192: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,974 INFO L290 TraceCheckUtils]: 193: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,975 INFO L290 TraceCheckUtils]: 194: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,975 INFO L290 TraceCheckUtils]: 195: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,975 INFO L290 TraceCheckUtils]: 196: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,975 INFO L290 TraceCheckUtils]: 197: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,976 INFO L290 TraceCheckUtils]: 198: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,976 INFO L290 TraceCheckUtils]: 199: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,976 INFO L290 TraceCheckUtils]: 200: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,976 INFO L290 TraceCheckUtils]: 201: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,977 INFO L290 TraceCheckUtils]: 202: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,977 INFO L290 TraceCheckUtils]: 203: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,977 INFO L290 TraceCheckUtils]: 204: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,977 INFO L290 TraceCheckUtils]: 205: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,978 INFO L290 TraceCheckUtils]: 206: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,978 INFO L290 TraceCheckUtils]: 207: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,978 INFO L290 TraceCheckUtils]: 208: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,978 INFO L290 TraceCheckUtils]: 209: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,979 INFO L290 TraceCheckUtils]: 210: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,979 INFO L290 TraceCheckUtils]: 211: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,979 INFO L290 TraceCheckUtils]: 212: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,979 INFO L290 TraceCheckUtils]: 213: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,980 INFO L290 TraceCheckUtils]: 214: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,980 INFO L290 TraceCheckUtils]: 215: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,980 INFO L290 TraceCheckUtils]: 216: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,980 INFO L290 TraceCheckUtils]: 217: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,981 INFO L290 TraceCheckUtils]: 218: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,981 INFO L290 TraceCheckUtils]: 219: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,981 INFO L290 TraceCheckUtils]: 220: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,981 INFO L290 TraceCheckUtils]: 221: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,982 INFO L290 TraceCheckUtils]: 222: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,982 INFO L290 TraceCheckUtils]: 223: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,982 INFO L290 TraceCheckUtils]: 224: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,982 INFO L290 TraceCheckUtils]: 225: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,982 INFO L290 TraceCheckUtils]: 226: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,983 INFO L290 TraceCheckUtils]: 227: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,983 INFO L290 TraceCheckUtils]: 228: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,983 INFO L290 TraceCheckUtils]: 229: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,983 INFO L290 TraceCheckUtils]: 230: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,984 INFO L290 TraceCheckUtils]: 231: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,984 INFO L290 TraceCheckUtils]: 232: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,984 INFO L290 TraceCheckUtils]: 233: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,984 INFO L290 TraceCheckUtils]: 234: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,985 INFO L290 TraceCheckUtils]: 235: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,985 INFO L290 TraceCheckUtils]: 236: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,985 INFO L290 TraceCheckUtils]: 237: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,985 INFO L290 TraceCheckUtils]: 238: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,985 INFO L290 TraceCheckUtils]: 239: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,986 INFO L290 TraceCheckUtils]: 240: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,986 INFO L290 TraceCheckUtils]: 241: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,986 INFO L290 TraceCheckUtils]: 242: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,986 INFO L290 TraceCheckUtils]: 243: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,987 INFO L290 TraceCheckUtils]: 244: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,987 INFO L290 TraceCheckUtils]: 245: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,987 INFO L290 TraceCheckUtils]: 246: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,987 INFO L290 TraceCheckUtils]: 247: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,988 INFO L290 TraceCheckUtils]: 248: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,988 INFO L290 TraceCheckUtils]: 249: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,988 INFO L290 TraceCheckUtils]: 250: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,988 INFO L290 TraceCheckUtils]: 251: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,988 INFO L290 TraceCheckUtils]: 252: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,989 INFO L290 TraceCheckUtils]: 253: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,989 INFO L290 TraceCheckUtils]: 254: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,989 INFO L290 TraceCheckUtils]: 255: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,989 INFO L290 TraceCheckUtils]: 256: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,990 INFO L290 TraceCheckUtils]: 257: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,990 INFO L290 TraceCheckUtils]: 258: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,990 INFO L290 TraceCheckUtils]: 259: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,990 INFO L290 TraceCheckUtils]: 260: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,990 INFO L290 TraceCheckUtils]: 261: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,991 INFO L290 TraceCheckUtils]: 262: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,991 INFO L290 TraceCheckUtils]: 263: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,991 INFO L290 TraceCheckUtils]: 264: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,991 INFO L290 TraceCheckUtils]: 265: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,992 INFO L290 TraceCheckUtils]: 266: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,992 INFO L290 TraceCheckUtils]: 267: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,992 INFO L290 TraceCheckUtils]: 268: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,992 INFO L290 TraceCheckUtils]: 269: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,993 INFO L290 TraceCheckUtils]: 270: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,993 INFO L290 TraceCheckUtils]: 271: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,993 INFO L290 TraceCheckUtils]: 272: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,993 INFO L290 TraceCheckUtils]: 273: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,993 INFO L290 TraceCheckUtils]: 274: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,994 INFO L290 TraceCheckUtils]: 275: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,994 INFO L290 TraceCheckUtils]: 276: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,994 INFO L290 TraceCheckUtils]: 277: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,994 INFO L290 TraceCheckUtils]: 278: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,995 INFO L290 TraceCheckUtils]: 279: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,995 INFO L290 TraceCheckUtils]: 280: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,995 INFO L290 TraceCheckUtils]: 281: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,995 INFO L290 TraceCheckUtils]: 282: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,996 INFO L290 TraceCheckUtils]: 283: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,996 INFO L290 TraceCheckUtils]: 284: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,996 INFO L290 TraceCheckUtils]: 285: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,996 INFO L290 TraceCheckUtils]: 286: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,997 INFO L290 TraceCheckUtils]: 287: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,997 INFO L290 TraceCheckUtils]: 288: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,997 INFO L290 TraceCheckUtils]: 289: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,999 INFO L290 TraceCheckUtils]: 290: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:54,999 INFO L290 TraceCheckUtils]: 291: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,000 INFO L290 TraceCheckUtils]: 292: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,000 INFO L290 TraceCheckUtils]: 293: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,000 INFO L290 TraceCheckUtils]: 294: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,000 INFO L290 TraceCheckUtils]: 295: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,001 INFO L290 TraceCheckUtils]: 296: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,001 INFO L290 TraceCheckUtils]: 297: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,001 INFO L290 TraceCheckUtils]: 298: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,001 INFO L290 TraceCheckUtils]: 299: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,002 INFO L290 TraceCheckUtils]: 300: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,002 INFO L290 TraceCheckUtils]: 301: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,002 INFO L290 TraceCheckUtils]: 302: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,002 INFO L290 TraceCheckUtils]: 303: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,002 INFO L290 TraceCheckUtils]: 304: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,003 INFO L290 TraceCheckUtils]: 305: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,003 INFO L290 TraceCheckUtils]: 306: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,003 INFO L290 TraceCheckUtils]: 307: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,004 INFO L290 TraceCheckUtils]: 308: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,004 INFO L290 TraceCheckUtils]: 309: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,004 INFO L290 TraceCheckUtils]: 310: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,004 INFO L290 TraceCheckUtils]: 311: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,005 INFO L290 TraceCheckUtils]: 312: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,005 INFO L290 TraceCheckUtils]: 313: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,005 INFO L290 TraceCheckUtils]: 314: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,005 INFO L290 TraceCheckUtils]: 315: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,006 INFO L290 TraceCheckUtils]: 316: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,006 INFO L290 TraceCheckUtils]: 317: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,006 INFO L290 TraceCheckUtils]: 318: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,006 INFO L290 TraceCheckUtils]: 319: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,007 INFO L290 TraceCheckUtils]: 320: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,007 INFO L290 TraceCheckUtils]: 321: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,007 INFO L290 TraceCheckUtils]: 322: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,007 INFO L290 TraceCheckUtils]: 323: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,008 INFO L290 TraceCheckUtils]: 324: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,008 INFO L290 TraceCheckUtils]: 325: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,008 INFO L290 TraceCheckUtils]: 326: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,008 INFO L290 TraceCheckUtils]: 327: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,008 INFO L290 TraceCheckUtils]: 328: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,009 INFO L290 TraceCheckUtils]: 329: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,009 INFO L290 TraceCheckUtils]: 330: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,009 INFO L290 TraceCheckUtils]: 331: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,009 INFO L290 TraceCheckUtils]: 332: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,010 INFO L290 TraceCheckUtils]: 333: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,010 INFO L290 TraceCheckUtils]: 334: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,010 INFO L290 TraceCheckUtils]: 335: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,010 INFO L290 TraceCheckUtils]: 336: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,011 INFO L290 TraceCheckUtils]: 337: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,011 INFO L290 TraceCheckUtils]: 338: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-08 03:36:55,011 INFO L290 TraceCheckUtils]: 339: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {58753#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:55,012 INFO L290 TraceCheckUtils]: 340: Hoare triple {58753#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {58753#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:55,012 INFO L290 TraceCheckUtils]: 341: Hoare triple {58753#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {58753#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-08 03:36:55,012 INFO L290 TraceCheckUtils]: 342: Hoare triple {58753#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {58754#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:36:55,013 INFO L290 TraceCheckUtils]: 343: Hoare triple {58754#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {58754#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:36:55,013 INFO L290 TraceCheckUtils]: 344: Hoare triple {58754#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {58754#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:36:55,013 INFO L290 TraceCheckUtils]: 345: Hoare triple {58754#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {58755#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:55,014 INFO L290 TraceCheckUtils]: 346: Hoare triple {58755#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {58755#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:55,014 INFO L290 TraceCheckUtils]: 347: Hoare triple {58755#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {58755#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:55,015 INFO L290 TraceCheckUtils]: 348: Hoare triple {58755#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {58756#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:55,015 INFO L290 TraceCheckUtils]: 349: Hoare triple {58756#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {58756#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:55,015 INFO L290 TraceCheckUtils]: 350: Hoare triple {58756#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {58756#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:55,016 INFO L290 TraceCheckUtils]: 351: Hoare triple {58756#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {58757#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 4))} is VALID [2022-04-08 03:36:55,016 INFO L290 TraceCheckUtils]: 352: Hoare triple {58757#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 4))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {58757#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 4))} is VALID [2022-04-08 03:36:55,017 INFO L290 TraceCheckUtils]: 353: Hoare triple {58757#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 4))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {58757#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 4))} is VALID [2022-04-08 03:36:55,028 INFO L290 TraceCheckUtils]: 354: Hoare triple {58757#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 4))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {58758#(and (<= main_~i~0 5) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:36:55,028 INFO L290 TraceCheckUtils]: 355: Hoare triple {58758#(and (<= main_~i~0 5) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {58758#(and (<= main_~i~0 5) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:36:55,029 INFO L290 TraceCheckUtils]: 356: Hoare triple {58758#(and (<= main_~i~0 5) (= (+ (- 20) main_~edgecount~0) 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {58758#(and (<= main_~i~0 5) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-08 03:36:55,029 INFO L290 TraceCheckUtils]: 357: Hoare triple {58758#(and (<= main_~i~0 5) (= (+ (- 20) main_~edgecount~0) 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {58759#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 6))} is VALID [2022-04-08 03:36:55,030 INFO L290 TraceCheckUtils]: 358: Hoare triple {58759#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 6))} assume !(~i~0 < ~edgecount~0); {58748#false} is VALID [2022-04-08 03:36:55,030 INFO L290 TraceCheckUtils]: 359: Hoare triple {58748#false} ~i~0 := 0; {58748#false} is VALID [2022-04-08 03:36:55,030 INFO L290 TraceCheckUtils]: 360: Hoare triple {58748#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58748#false} is VALID [2022-04-08 03:36:55,030 INFO L272 TraceCheckUtils]: 361: Hoare triple {58748#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {58748#false} is VALID [2022-04-08 03:36:55,030 INFO L290 TraceCheckUtils]: 362: Hoare triple {58748#false} ~cond := #in~cond; {58748#false} is VALID [2022-04-08 03:36:55,030 INFO L290 TraceCheckUtils]: 363: Hoare triple {58748#false} assume 0 == ~cond; {58748#false} is VALID [2022-04-08 03:36:55,030 INFO L290 TraceCheckUtils]: 364: Hoare triple {58748#false} assume !false; {58748#false} is VALID [2022-04-08 03:36:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15471 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 03:36:55,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:36:55,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776485824] [2022-04-08 03:36:55,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776485824] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:36:55,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781123028] [2022-04-08 03:36:55,031 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:36:55,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:36:55,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:36:55,032 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:36:55,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-08 03:36:55,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:36:55,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:36:55,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 2000 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 03:36:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:55,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:36:57,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {58747#true} call ULTIMATE.init(); {58747#true} is VALID [2022-04-08 03:36:57,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {58747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {58747#true} is VALID [2022-04-08 03:36:57,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {58747#true} assume true; {58747#true} is VALID [2022-04-08 03:36:57,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58747#true} {58747#true} #107#return; {58747#true} is VALID [2022-04-08 03:36:57,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {58747#true} call #t~ret22 := main(); {58747#true} is VALID [2022-04-08 03:36:57,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {58747#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {58747#true} is VALID [2022-04-08 03:36:57,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 03:36:57,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {58747#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 03:36:57,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 03:36:57,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 03:36:57,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 03:36:57,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 03:36:57,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 03:36:57,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 03:36:57,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 03:36:57,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 03:36:57,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 03:36:57,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 03:36:57,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 03:36:57,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 03:36:57,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 03:36:57,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {58747#true} assume !(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 03:36:57,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {58747#true} ~i~0 := 0; {58747#true} is VALID [2022-04-08 03:36:57,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {58833#(<= 0 main_~j~0)} is VALID [2022-04-08 03:36:57,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {58833#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58833#(<= 0 main_~j~0)} is VALID [2022-04-08 03:36:57,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {58833#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58833#(<= 0 main_~j~0)} is VALID [2022-04-08 03:36:57,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {58833#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58843#(<= 1 main_~j~0)} is VALID [2022-04-08 03:36:57,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {58843#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58843#(<= 1 main_~j~0)} is VALID [2022-04-08 03:36:57,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {58843#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58843#(<= 1 main_~j~0)} is VALID [2022-04-08 03:36:57,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {58843#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58853#(<= 2 main_~j~0)} is VALID [2022-04-08 03:36:57,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {58853#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58853#(<= 2 main_~j~0)} is VALID [2022-04-08 03:36:57,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {58853#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58853#(<= 2 main_~j~0)} is VALID [2022-04-08 03:36:57,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {58853#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58863#(<= 3 main_~j~0)} is VALID [2022-04-08 03:36:57,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {58863#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58863#(<= 3 main_~j~0)} is VALID [2022-04-08 03:36:57,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {58863#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58863#(<= 3 main_~j~0)} is VALID [2022-04-08 03:36:57,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {58863#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58873#(<= 4 main_~j~0)} is VALID [2022-04-08 03:36:57,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {58873#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58873#(<= 4 main_~j~0)} is VALID [2022-04-08 03:36:57,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {58873#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58873#(<= 4 main_~j~0)} is VALID [2022-04-08 03:36:57,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {58873#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58883#(<= 5 main_~j~0)} is VALID [2022-04-08 03:36:57,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {58883#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58883#(<= 5 main_~j~0)} is VALID [2022-04-08 03:36:57,210 INFO L290 TraceCheckUtils]: 40: Hoare triple {58883#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58883#(<= 5 main_~j~0)} is VALID [2022-04-08 03:36:57,211 INFO L290 TraceCheckUtils]: 41: Hoare triple {58883#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58893#(<= 6 main_~j~0)} is VALID [2022-04-08 03:36:57,211 INFO L290 TraceCheckUtils]: 42: Hoare triple {58893#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58893#(<= 6 main_~j~0)} is VALID [2022-04-08 03:36:57,211 INFO L290 TraceCheckUtils]: 43: Hoare triple {58893#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58893#(<= 6 main_~j~0)} is VALID [2022-04-08 03:36:57,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {58893#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58903#(<= 7 main_~j~0)} is VALID [2022-04-08 03:36:57,212 INFO L290 TraceCheckUtils]: 45: Hoare triple {58903#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58903#(<= 7 main_~j~0)} is VALID [2022-04-08 03:36:57,212 INFO L290 TraceCheckUtils]: 46: Hoare triple {58903#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58903#(<= 7 main_~j~0)} is VALID [2022-04-08 03:36:57,213 INFO L290 TraceCheckUtils]: 47: Hoare triple {58903#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58913#(<= 8 main_~j~0)} is VALID [2022-04-08 03:36:57,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {58913#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58913#(<= 8 main_~j~0)} is VALID [2022-04-08 03:36:57,213 INFO L290 TraceCheckUtils]: 49: Hoare triple {58913#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58913#(<= 8 main_~j~0)} is VALID [2022-04-08 03:36:57,213 INFO L290 TraceCheckUtils]: 50: Hoare triple {58913#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58923#(<= 9 main_~j~0)} is VALID [2022-04-08 03:36:57,214 INFO L290 TraceCheckUtils]: 51: Hoare triple {58923#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58923#(<= 9 main_~j~0)} is VALID [2022-04-08 03:36:57,214 INFO L290 TraceCheckUtils]: 52: Hoare triple {58923#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58923#(<= 9 main_~j~0)} is VALID [2022-04-08 03:36:57,214 INFO L290 TraceCheckUtils]: 53: Hoare triple {58923#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58933#(<= 10 main_~j~0)} is VALID [2022-04-08 03:36:57,215 INFO L290 TraceCheckUtils]: 54: Hoare triple {58933#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58933#(<= 10 main_~j~0)} is VALID [2022-04-08 03:36:57,215 INFO L290 TraceCheckUtils]: 55: Hoare triple {58933#(<= 10 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58933#(<= 10 main_~j~0)} is VALID [2022-04-08 03:36:57,215 INFO L290 TraceCheckUtils]: 56: Hoare triple {58933#(<= 10 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58943#(<= 11 main_~j~0)} is VALID [2022-04-08 03:36:57,216 INFO L290 TraceCheckUtils]: 57: Hoare triple {58943#(<= 11 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58943#(<= 11 main_~j~0)} is VALID [2022-04-08 03:36:57,216 INFO L290 TraceCheckUtils]: 58: Hoare triple {58943#(<= 11 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58943#(<= 11 main_~j~0)} is VALID [2022-04-08 03:36:57,216 INFO L290 TraceCheckUtils]: 59: Hoare triple {58943#(<= 11 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58953#(<= 12 main_~j~0)} is VALID [2022-04-08 03:36:57,216 INFO L290 TraceCheckUtils]: 60: Hoare triple {58953#(<= 12 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58953#(<= 12 main_~j~0)} is VALID [2022-04-08 03:36:57,217 INFO L290 TraceCheckUtils]: 61: Hoare triple {58953#(<= 12 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58953#(<= 12 main_~j~0)} is VALID [2022-04-08 03:36:57,217 INFO L290 TraceCheckUtils]: 62: Hoare triple {58953#(<= 12 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58963#(<= 13 main_~j~0)} is VALID [2022-04-08 03:36:57,217 INFO L290 TraceCheckUtils]: 63: Hoare triple {58963#(<= 13 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58963#(<= 13 main_~j~0)} is VALID [2022-04-08 03:36:57,218 INFO L290 TraceCheckUtils]: 64: Hoare triple {58963#(<= 13 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58963#(<= 13 main_~j~0)} is VALID [2022-04-08 03:36:57,218 INFO L290 TraceCheckUtils]: 65: Hoare triple {58963#(<= 13 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58973#(<= 14 main_~j~0)} is VALID [2022-04-08 03:36:57,218 INFO L290 TraceCheckUtils]: 66: Hoare triple {58973#(<= 14 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58973#(<= 14 main_~j~0)} is VALID [2022-04-08 03:36:57,219 INFO L290 TraceCheckUtils]: 67: Hoare triple {58973#(<= 14 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58973#(<= 14 main_~j~0)} is VALID [2022-04-08 03:36:57,219 INFO L290 TraceCheckUtils]: 68: Hoare triple {58973#(<= 14 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58983#(<= 15 main_~j~0)} is VALID [2022-04-08 03:36:57,219 INFO L290 TraceCheckUtils]: 69: Hoare triple {58983#(<= 15 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58983#(<= 15 main_~j~0)} is VALID [2022-04-08 03:36:57,220 INFO L290 TraceCheckUtils]: 70: Hoare triple {58983#(<= 15 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58983#(<= 15 main_~j~0)} is VALID [2022-04-08 03:36:57,220 INFO L290 TraceCheckUtils]: 71: Hoare triple {58983#(<= 15 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58993#(<= 16 main_~j~0)} is VALID [2022-04-08 03:36:57,220 INFO L290 TraceCheckUtils]: 72: Hoare triple {58993#(<= 16 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58993#(<= 16 main_~j~0)} is VALID [2022-04-08 03:36:57,220 INFO L290 TraceCheckUtils]: 73: Hoare triple {58993#(<= 16 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58993#(<= 16 main_~j~0)} is VALID [2022-04-08 03:36:57,221 INFO L290 TraceCheckUtils]: 74: Hoare triple {58993#(<= 16 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59003#(<= 17 main_~j~0)} is VALID [2022-04-08 03:36:57,221 INFO L290 TraceCheckUtils]: 75: Hoare triple {59003#(<= 17 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59003#(<= 17 main_~j~0)} is VALID [2022-04-08 03:36:57,221 INFO L290 TraceCheckUtils]: 76: Hoare triple {59003#(<= 17 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59003#(<= 17 main_~j~0)} is VALID [2022-04-08 03:36:57,222 INFO L290 TraceCheckUtils]: 77: Hoare triple {59003#(<= 17 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59013#(<= 18 main_~j~0)} is VALID [2022-04-08 03:36:57,222 INFO L290 TraceCheckUtils]: 78: Hoare triple {59013#(<= 18 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59013#(<= 18 main_~j~0)} is VALID [2022-04-08 03:36:57,222 INFO L290 TraceCheckUtils]: 79: Hoare triple {59013#(<= 18 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59013#(<= 18 main_~j~0)} is VALID [2022-04-08 03:36:57,223 INFO L290 TraceCheckUtils]: 80: Hoare triple {59013#(<= 18 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59023#(<= 19 main_~j~0)} is VALID [2022-04-08 03:36:57,223 INFO L290 TraceCheckUtils]: 81: Hoare triple {59023#(<= 19 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,224 INFO L290 TraceCheckUtils]: 82: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,224 INFO L290 TraceCheckUtils]: 83: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,224 INFO L290 TraceCheckUtils]: 84: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,224 INFO L290 TraceCheckUtils]: 85: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,225 INFO L290 TraceCheckUtils]: 86: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,225 INFO L290 TraceCheckUtils]: 87: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,225 INFO L290 TraceCheckUtils]: 88: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,226 INFO L290 TraceCheckUtils]: 89: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,226 INFO L290 TraceCheckUtils]: 90: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,226 INFO L290 TraceCheckUtils]: 91: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,226 INFO L290 TraceCheckUtils]: 92: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,227 INFO L290 TraceCheckUtils]: 93: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,227 INFO L290 TraceCheckUtils]: 94: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,227 INFO L290 TraceCheckUtils]: 95: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,227 INFO L290 TraceCheckUtils]: 96: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,228 INFO L290 TraceCheckUtils]: 97: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,228 INFO L290 TraceCheckUtils]: 98: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,228 INFO L290 TraceCheckUtils]: 99: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,229 INFO L290 TraceCheckUtils]: 100: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,229 INFO L290 TraceCheckUtils]: 101: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,229 INFO L290 TraceCheckUtils]: 102: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,229 INFO L290 TraceCheckUtils]: 103: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,230 INFO L290 TraceCheckUtils]: 104: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,230 INFO L290 TraceCheckUtils]: 105: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,230 INFO L290 TraceCheckUtils]: 106: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,230 INFO L290 TraceCheckUtils]: 107: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,231 INFO L290 TraceCheckUtils]: 108: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,231 INFO L290 TraceCheckUtils]: 109: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,231 INFO L290 TraceCheckUtils]: 110: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,231 INFO L290 TraceCheckUtils]: 111: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,232 INFO L290 TraceCheckUtils]: 112: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,232 INFO L290 TraceCheckUtils]: 113: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,232 INFO L290 TraceCheckUtils]: 114: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,233 INFO L290 TraceCheckUtils]: 115: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,233 INFO L290 TraceCheckUtils]: 116: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,233 INFO L290 TraceCheckUtils]: 117: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,233 INFO L290 TraceCheckUtils]: 118: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,234 INFO L290 TraceCheckUtils]: 119: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,234 INFO L290 TraceCheckUtils]: 120: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,234 INFO L290 TraceCheckUtils]: 121: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,234 INFO L290 TraceCheckUtils]: 122: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,235 INFO L290 TraceCheckUtils]: 123: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,235 INFO L290 TraceCheckUtils]: 124: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,235 INFO L290 TraceCheckUtils]: 125: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,236 INFO L290 TraceCheckUtils]: 126: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,236 INFO L290 TraceCheckUtils]: 127: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,236 INFO L290 TraceCheckUtils]: 128: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,236 INFO L290 TraceCheckUtils]: 129: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,237 INFO L290 TraceCheckUtils]: 130: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,237 INFO L290 TraceCheckUtils]: 131: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,237 INFO L290 TraceCheckUtils]: 132: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,237 INFO L290 TraceCheckUtils]: 133: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,238 INFO L290 TraceCheckUtils]: 134: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,238 INFO L290 TraceCheckUtils]: 135: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,238 INFO L290 TraceCheckUtils]: 136: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,238 INFO L290 TraceCheckUtils]: 137: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,239 INFO L290 TraceCheckUtils]: 138: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,239 INFO L290 TraceCheckUtils]: 139: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,239 INFO L290 TraceCheckUtils]: 140: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,240 INFO L290 TraceCheckUtils]: 141: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,240 INFO L290 TraceCheckUtils]: 142: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,240 INFO L290 TraceCheckUtils]: 143: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,240 INFO L290 TraceCheckUtils]: 144: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,241 INFO L290 TraceCheckUtils]: 145: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,241 INFO L290 TraceCheckUtils]: 146: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,241 INFO L290 TraceCheckUtils]: 147: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,241 INFO L290 TraceCheckUtils]: 148: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,242 INFO L290 TraceCheckUtils]: 149: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,242 INFO L290 TraceCheckUtils]: 150: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,242 INFO L290 TraceCheckUtils]: 151: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,242 INFO L290 TraceCheckUtils]: 152: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,243 INFO L290 TraceCheckUtils]: 153: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,243 INFO L290 TraceCheckUtils]: 154: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,243 INFO L290 TraceCheckUtils]: 155: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,243 INFO L290 TraceCheckUtils]: 156: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,244 INFO L290 TraceCheckUtils]: 157: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,244 INFO L290 TraceCheckUtils]: 158: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,244 INFO L290 TraceCheckUtils]: 159: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,245 INFO L290 TraceCheckUtils]: 160: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,245 INFO L290 TraceCheckUtils]: 161: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,245 INFO L290 TraceCheckUtils]: 162: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,245 INFO L290 TraceCheckUtils]: 163: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,246 INFO L290 TraceCheckUtils]: 164: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,246 INFO L290 TraceCheckUtils]: 165: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,246 INFO L290 TraceCheckUtils]: 166: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,246 INFO L290 TraceCheckUtils]: 167: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,247 INFO L290 TraceCheckUtils]: 168: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,247 INFO L290 TraceCheckUtils]: 169: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,247 INFO L290 TraceCheckUtils]: 170: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,247 INFO L290 TraceCheckUtils]: 171: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,248 INFO L290 TraceCheckUtils]: 172: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,248 INFO L290 TraceCheckUtils]: 173: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,248 INFO L290 TraceCheckUtils]: 174: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,249 INFO L290 TraceCheckUtils]: 175: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,249 INFO L290 TraceCheckUtils]: 176: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,249 INFO L290 TraceCheckUtils]: 177: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,249 INFO L290 TraceCheckUtils]: 178: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,250 INFO L290 TraceCheckUtils]: 179: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,250 INFO L290 TraceCheckUtils]: 180: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,250 INFO L290 TraceCheckUtils]: 181: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,250 INFO L290 TraceCheckUtils]: 182: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,251 INFO L290 TraceCheckUtils]: 183: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,251 INFO L290 TraceCheckUtils]: 184: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,251 INFO L290 TraceCheckUtils]: 185: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,251 INFO L290 TraceCheckUtils]: 186: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,252 INFO L290 TraceCheckUtils]: 187: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,252 INFO L290 TraceCheckUtils]: 188: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,252 INFO L290 TraceCheckUtils]: 189: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,253 INFO L290 TraceCheckUtils]: 190: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,253 INFO L290 TraceCheckUtils]: 191: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,253 INFO L290 TraceCheckUtils]: 192: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,253 INFO L290 TraceCheckUtils]: 193: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,254 INFO L290 TraceCheckUtils]: 194: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,254 INFO L290 TraceCheckUtils]: 195: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,254 INFO L290 TraceCheckUtils]: 196: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,254 INFO L290 TraceCheckUtils]: 197: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,255 INFO L290 TraceCheckUtils]: 198: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,255 INFO L290 TraceCheckUtils]: 199: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,255 INFO L290 TraceCheckUtils]: 200: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,255 INFO L290 TraceCheckUtils]: 201: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,256 INFO L290 TraceCheckUtils]: 202: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,256 INFO L290 TraceCheckUtils]: 203: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,256 INFO L290 TraceCheckUtils]: 204: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,257 INFO L290 TraceCheckUtils]: 205: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,257 INFO L290 TraceCheckUtils]: 206: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,257 INFO L290 TraceCheckUtils]: 207: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,257 INFO L290 TraceCheckUtils]: 208: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,258 INFO L290 TraceCheckUtils]: 209: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,258 INFO L290 TraceCheckUtils]: 210: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,258 INFO L290 TraceCheckUtils]: 211: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,258 INFO L290 TraceCheckUtils]: 212: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,259 INFO L290 TraceCheckUtils]: 213: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,259 INFO L290 TraceCheckUtils]: 214: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,259 INFO L290 TraceCheckUtils]: 215: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,260 INFO L290 TraceCheckUtils]: 216: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,260 INFO L290 TraceCheckUtils]: 217: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,260 INFO L290 TraceCheckUtils]: 218: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,260 INFO L290 TraceCheckUtils]: 219: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,261 INFO L290 TraceCheckUtils]: 220: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,261 INFO L290 TraceCheckUtils]: 221: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,261 INFO L290 TraceCheckUtils]: 222: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,261 INFO L290 TraceCheckUtils]: 223: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,262 INFO L290 TraceCheckUtils]: 224: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,262 INFO L290 TraceCheckUtils]: 225: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,262 INFO L290 TraceCheckUtils]: 226: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,262 INFO L290 TraceCheckUtils]: 227: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,263 INFO L290 TraceCheckUtils]: 228: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,263 INFO L290 TraceCheckUtils]: 229: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,263 INFO L290 TraceCheckUtils]: 230: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,263 INFO L290 TraceCheckUtils]: 231: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,264 INFO L290 TraceCheckUtils]: 232: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,264 INFO L290 TraceCheckUtils]: 233: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,264 INFO L290 TraceCheckUtils]: 234: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,265 INFO L290 TraceCheckUtils]: 235: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,265 INFO L290 TraceCheckUtils]: 236: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,265 INFO L290 TraceCheckUtils]: 237: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,265 INFO L290 TraceCheckUtils]: 238: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,266 INFO L290 TraceCheckUtils]: 239: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,266 INFO L290 TraceCheckUtils]: 240: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,266 INFO L290 TraceCheckUtils]: 241: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,266 INFO L290 TraceCheckUtils]: 242: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,267 INFO L290 TraceCheckUtils]: 243: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,267 INFO L290 TraceCheckUtils]: 244: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,267 INFO L290 TraceCheckUtils]: 245: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,267 INFO L290 TraceCheckUtils]: 246: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,268 INFO L290 TraceCheckUtils]: 247: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,268 INFO L290 TraceCheckUtils]: 248: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,268 INFO L290 TraceCheckUtils]: 249: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,269 INFO L290 TraceCheckUtils]: 250: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,269 INFO L290 TraceCheckUtils]: 251: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,269 INFO L290 TraceCheckUtils]: 252: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,269 INFO L290 TraceCheckUtils]: 253: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,270 INFO L290 TraceCheckUtils]: 254: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,270 INFO L290 TraceCheckUtils]: 255: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,270 INFO L290 TraceCheckUtils]: 256: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,270 INFO L290 TraceCheckUtils]: 257: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,271 INFO L290 TraceCheckUtils]: 258: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,271 INFO L290 TraceCheckUtils]: 259: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,271 INFO L290 TraceCheckUtils]: 260: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,271 INFO L290 TraceCheckUtils]: 261: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,272 INFO L290 TraceCheckUtils]: 262: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,272 INFO L290 TraceCheckUtils]: 263: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,272 INFO L290 TraceCheckUtils]: 264: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,272 INFO L290 TraceCheckUtils]: 265: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,273 INFO L290 TraceCheckUtils]: 266: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,273 INFO L290 TraceCheckUtils]: 267: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,273 INFO L290 TraceCheckUtils]: 268: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,273 INFO L290 TraceCheckUtils]: 269: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,274 INFO L290 TraceCheckUtils]: 270: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,274 INFO L290 TraceCheckUtils]: 271: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,274 INFO L290 TraceCheckUtils]: 272: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,274 INFO L290 TraceCheckUtils]: 273: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,275 INFO L290 TraceCheckUtils]: 274: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,275 INFO L290 TraceCheckUtils]: 275: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,275 INFO L290 TraceCheckUtils]: 276: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,276 INFO L290 TraceCheckUtils]: 277: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,276 INFO L290 TraceCheckUtils]: 278: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,276 INFO L290 TraceCheckUtils]: 279: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,276 INFO L290 TraceCheckUtils]: 280: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,277 INFO L290 TraceCheckUtils]: 281: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,277 INFO L290 TraceCheckUtils]: 282: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,277 INFO L290 TraceCheckUtils]: 283: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,277 INFO L290 TraceCheckUtils]: 284: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,278 INFO L290 TraceCheckUtils]: 285: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,278 INFO L290 TraceCheckUtils]: 286: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,278 INFO L290 TraceCheckUtils]: 287: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,278 INFO L290 TraceCheckUtils]: 288: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,279 INFO L290 TraceCheckUtils]: 289: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,279 INFO L290 TraceCheckUtils]: 290: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,279 INFO L290 TraceCheckUtils]: 291: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,280 INFO L290 TraceCheckUtils]: 292: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,280 INFO L290 TraceCheckUtils]: 293: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,280 INFO L290 TraceCheckUtils]: 294: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,280 INFO L290 TraceCheckUtils]: 295: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,281 INFO L290 TraceCheckUtils]: 296: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,281 INFO L290 TraceCheckUtils]: 297: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,281 INFO L290 TraceCheckUtils]: 298: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,281 INFO L290 TraceCheckUtils]: 299: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,282 INFO L290 TraceCheckUtils]: 300: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,282 INFO L290 TraceCheckUtils]: 301: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,282 INFO L290 TraceCheckUtils]: 302: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,282 INFO L290 TraceCheckUtils]: 303: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,283 INFO L290 TraceCheckUtils]: 304: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,283 INFO L290 TraceCheckUtils]: 305: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,283 INFO L290 TraceCheckUtils]: 306: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,284 INFO L290 TraceCheckUtils]: 307: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,284 INFO L290 TraceCheckUtils]: 308: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,284 INFO L290 TraceCheckUtils]: 309: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,284 INFO L290 TraceCheckUtils]: 310: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,285 INFO L290 TraceCheckUtils]: 311: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,285 INFO L290 TraceCheckUtils]: 312: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,285 INFO L290 TraceCheckUtils]: 313: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,285 INFO L290 TraceCheckUtils]: 314: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,286 INFO L290 TraceCheckUtils]: 315: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,286 INFO L290 TraceCheckUtils]: 316: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,286 INFO L290 TraceCheckUtils]: 317: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,287 INFO L290 TraceCheckUtils]: 318: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,287 INFO L290 TraceCheckUtils]: 319: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,287 INFO L290 TraceCheckUtils]: 320: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,287 INFO L290 TraceCheckUtils]: 321: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,288 INFO L290 TraceCheckUtils]: 322: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,288 INFO L290 TraceCheckUtils]: 323: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,288 INFO L290 TraceCheckUtils]: 324: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,288 INFO L290 TraceCheckUtils]: 325: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,289 INFO L290 TraceCheckUtils]: 326: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,289 INFO L290 TraceCheckUtils]: 327: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,289 INFO L290 TraceCheckUtils]: 328: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,290 INFO L290 TraceCheckUtils]: 329: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,290 INFO L290 TraceCheckUtils]: 330: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,290 INFO L290 TraceCheckUtils]: 331: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,290 INFO L290 TraceCheckUtils]: 332: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,291 INFO L290 TraceCheckUtils]: 333: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,291 INFO L290 TraceCheckUtils]: 334: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,291 INFO L290 TraceCheckUtils]: 335: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,291 INFO L290 TraceCheckUtils]: 336: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,292 INFO L290 TraceCheckUtils]: 337: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,292 INFO L290 TraceCheckUtils]: 338: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-08 03:36:57,292 INFO L290 TraceCheckUtils]: 339: Hoare triple {59027#(< 19 main_~edgecount~0)} ~i~0 := 0; {59802#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 03:36:57,293 INFO L290 TraceCheckUtils]: 340: Hoare triple {59802#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59802#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 03:36:57,293 INFO L290 TraceCheckUtils]: 341: Hoare triple {59802#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59802#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-08 03:36:57,294 INFO L290 TraceCheckUtils]: 342: Hoare triple {59802#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59812#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 03:36:57,294 INFO L290 TraceCheckUtils]: 343: Hoare triple {59812#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59812#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 03:36:57,295 INFO L290 TraceCheckUtils]: 344: Hoare triple {59812#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59812#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-08 03:36:57,295 INFO L290 TraceCheckUtils]: 345: Hoare triple {59812#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59822#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:57,296 INFO L290 TraceCheckUtils]: 346: Hoare triple {59822#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59822#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:57,296 INFO L290 TraceCheckUtils]: 347: Hoare triple {59822#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59822#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:36:57,296 INFO L290 TraceCheckUtils]: 348: Hoare triple {59822#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59832#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:57,297 INFO L290 TraceCheckUtils]: 349: Hoare triple {59832#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59832#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:57,297 INFO L290 TraceCheckUtils]: 350: Hoare triple {59832#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59832#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-08 03:36:57,298 INFO L290 TraceCheckUtils]: 351: Hoare triple {59832#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59842#(and (< 19 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-08 03:36:57,298 INFO L290 TraceCheckUtils]: 352: Hoare triple {59842#(and (< 19 main_~edgecount~0) (<= main_~i~0 4))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59842#(and (< 19 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-08 03:36:57,298 INFO L290 TraceCheckUtils]: 353: Hoare triple {59842#(and (< 19 main_~edgecount~0) (<= main_~i~0 4))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59842#(and (< 19 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-08 03:36:57,299 INFO L290 TraceCheckUtils]: 354: Hoare triple {59842#(and (< 19 main_~edgecount~0) (<= main_~i~0 4))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59852#(and (<= main_~i~0 5) (< 19 main_~edgecount~0))} is VALID [2022-04-08 03:36:57,299 INFO L290 TraceCheckUtils]: 355: Hoare triple {59852#(and (<= main_~i~0 5) (< 19 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59852#(and (<= main_~i~0 5) (< 19 main_~edgecount~0))} is VALID [2022-04-08 03:36:57,300 INFO L290 TraceCheckUtils]: 356: Hoare triple {59852#(and (<= main_~i~0 5) (< 19 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59852#(and (<= main_~i~0 5) (< 19 main_~edgecount~0))} is VALID [2022-04-08 03:36:57,300 INFO L290 TraceCheckUtils]: 357: Hoare triple {59852#(and (<= main_~i~0 5) (< 19 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59862#(and (< 19 main_~edgecount~0) (<= main_~i~0 6))} is VALID [2022-04-08 03:36:57,301 INFO L290 TraceCheckUtils]: 358: Hoare triple {59862#(and (< 19 main_~edgecount~0) (<= main_~i~0 6))} assume !(~i~0 < ~edgecount~0); {58748#false} is VALID [2022-04-08 03:36:57,301 INFO L290 TraceCheckUtils]: 359: Hoare triple {58748#false} ~i~0 := 0; {58748#false} is VALID [2022-04-08 03:36:57,301 INFO L290 TraceCheckUtils]: 360: Hoare triple {58748#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58748#false} is VALID [2022-04-08 03:36:57,301 INFO L272 TraceCheckUtils]: 361: Hoare triple {58748#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {58748#false} is VALID [2022-04-08 03:36:57,301 INFO L290 TraceCheckUtils]: 362: Hoare triple {58748#false} ~cond := #in~cond; {58748#false} is VALID [2022-04-08 03:36:57,301 INFO L290 TraceCheckUtils]: 363: Hoare triple {58748#false} assume 0 == ~cond; {58748#false} is VALID [2022-04-08 03:36:57,301 INFO L290 TraceCheckUtils]: 364: Hoare triple {58748#false} assume !false; {58748#false} is VALID [2022-04-08 03:36:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 15471 backedges. 537 proven. 4829 refuted. 0 times theorem prover too weak. 10105 trivial. 0 not checked. [2022-04-08 03:36:57,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:36:58,685 INFO L290 TraceCheckUtils]: 364: Hoare triple {58748#false} assume !false; {58748#false} is VALID [2022-04-08 03:36:58,685 INFO L290 TraceCheckUtils]: 363: Hoare triple {58748#false} assume 0 == ~cond; {58748#false} is VALID [2022-04-08 03:36:58,685 INFO L290 TraceCheckUtils]: 362: Hoare triple {58748#false} ~cond := #in~cond; {58748#false} is VALID [2022-04-08 03:36:58,685 INFO L272 TraceCheckUtils]: 361: Hoare triple {58748#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {58748#false} is VALID [2022-04-08 03:36:58,685 INFO L290 TraceCheckUtils]: 360: Hoare triple {58748#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58748#false} is VALID [2022-04-08 03:36:58,685 INFO L290 TraceCheckUtils]: 359: Hoare triple {58748#false} ~i~0 := 0; {58748#false} is VALID [2022-04-08 03:36:58,685 INFO L290 TraceCheckUtils]: 358: Hoare triple {59902#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {58748#false} is VALID [2022-04-08 03:36:58,686 INFO L290 TraceCheckUtils]: 357: Hoare triple {59906#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59902#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,686 INFO L290 TraceCheckUtils]: 356: Hoare triple {59906#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59906#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:58,686 INFO L290 TraceCheckUtils]: 355: Hoare triple {59906#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59906#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:58,687 INFO L290 TraceCheckUtils]: 354: Hoare triple {59916#(< (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59906#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-08 03:36:58,687 INFO L290 TraceCheckUtils]: 353: Hoare triple {59916#(< (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59916#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:36:58,687 INFO L290 TraceCheckUtils]: 352: Hoare triple {59916#(< (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59916#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:36:58,688 INFO L290 TraceCheckUtils]: 351: Hoare triple {59926#(< (+ main_~i~0 3) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59916#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-08 03:36:58,688 INFO L290 TraceCheckUtils]: 350: Hoare triple {59926#(< (+ main_~i~0 3) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59926#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:36:58,688 INFO L290 TraceCheckUtils]: 349: Hoare triple {59926#(< (+ main_~i~0 3) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59926#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:36:58,688 INFO L290 TraceCheckUtils]: 348: Hoare triple {59936#(< (+ main_~i~0 4) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59926#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-08 03:36:58,689 INFO L290 TraceCheckUtils]: 347: Hoare triple {59936#(< (+ main_~i~0 4) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59936#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:36:58,689 INFO L290 TraceCheckUtils]: 346: Hoare triple {59936#(< (+ main_~i~0 4) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59936#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:36:58,689 INFO L290 TraceCheckUtils]: 345: Hoare triple {59946#(< (+ 5 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59936#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-08 03:36:58,690 INFO L290 TraceCheckUtils]: 344: Hoare triple {59946#(< (+ 5 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59946#(< (+ 5 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 03:36:58,690 INFO L290 TraceCheckUtils]: 343: Hoare triple {59946#(< (+ 5 main_~i~0) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59946#(< (+ 5 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 03:36:58,690 INFO L290 TraceCheckUtils]: 342: Hoare triple {59956#(< (+ main_~i~0 6) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59946#(< (+ 5 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 03:36:58,691 INFO L290 TraceCheckUtils]: 341: Hoare triple {59956#(< (+ main_~i~0 6) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59956#(< (+ main_~i~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:36:58,691 INFO L290 TraceCheckUtils]: 340: Hoare triple {59956#(< (+ main_~i~0 6) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59956#(< (+ main_~i~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:36:58,691 INFO L290 TraceCheckUtils]: 339: Hoare triple {59966#(< 6 main_~edgecount~0)} ~i~0 := 0; {59956#(< (+ main_~i~0 6) main_~edgecount~0)} is VALID [2022-04-08 03:36:58,691 INFO L290 TraceCheckUtils]: 338: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,692 INFO L290 TraceCheckUtils]: 337: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,692 INFO L290 TraceCheckUtils]: 336: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,692 INFO L290 TraceCheckUtils]: 335: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,692 INFO L290 TraceCheckUtils]: 334: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,692 INFO L290 TraceCheckUtils]: 333: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,693 INFO L290 TraceCheckUtils]: 332: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,693 INFO L290 TraceCheckUtils]: 331: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,693 INFO L290 TraceCheckUtils]: 330: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,693 INFO L290 TraceCheckUtils]: 329: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,694 INFO L290 TraceCheckUtils]: 328: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,694 INFO L290 TraceCheckUtils]: 327: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,694 INFO L290 TraceCheckUtils]: 326: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,694 INFO L290 TraceCheckUtils]: 325: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,695 INFO L290 TraceCheckUtils]: 324: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,695 INFO L290 TraceCheckUtils]: 323: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,695 INFO L290 TraceCheckUtils]: 322: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,695 INFO L290 TraceCheckUtils]: 321: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,696 INFO L290 TraceCheckUtils]: 320: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,696 INFO L290 TraceCheckUtils]: 319: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,696 INFO L290 TraceCheckUtils]: 318: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,696 INFO L290 TraceCheckUtils]: 317: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,697 INFO L290 TraceCheckUtils]: 316: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,697 INFO L290 TraceCheckUtils]: 315: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,697 INFO L290 TraceCheckUtils]: 314: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,697 INFO L290 TraceCheckUtils]: 313: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,698 INFO L290 TraceCheckUtils]: 312: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,698 INFO L290 TraceCheckUtils]: 311: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,698 INFO L290 TraceCheckUtils]: 310: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,698 INFO L290 TraceCheckUtils]: 309: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,698 INFO L290 TraceCheckUtils]: 308: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,699 INFO L290 TraceCheckUtils]: 307: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,699 INFO L290 TraceCheckUtils]: 306: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,699 INFO L290 TraceCheckUtils]: 305: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,699 INFO L290 TraceCheckUtils]: 304: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,700 INFO L290 TraceCheckUtils]: 303: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,700 INFO L290 TraceCheckUtils]: 302: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,700 INFO L290 TraceCheckUtils]: 301: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,700 INFO L290 TraceCheckUtils]: 300: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,701 INFO L290 TraceCheckUtils]: 299: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,701 INFO L290 TraceCheckUtils]: 298: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,701 INFO L290 TraceCheckUtils]: 297: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,701 INFO L290 TraceCheckUtils]: 296: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,701 INFO L290 TraceCheckUtils]: 295: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,702 INFO L290 TraceCheckUtils]: 294: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,702 INFO L290 TraceCheckUtils]: 293: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,702 INFO L290 TraceCheckUtils]: 292: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,702 INFO L290 TraceCheckUtils]: 291: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,703 INFO L290 TraceCheckUtils]: 290: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,703 INFO L290 TraceCheckUtils]: 289: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,703 INFO L290 TraceCheckUtils]: 288: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,703 INFO L290 TraceCheckUtils]: 287: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,704 INFO L290 TraceCheckUtils]: 286: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,704 INFO L290 TraceCheckUtils]: 285: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,704 INFO L290 TraceCheckUtils]: 284: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,704 INFO L290 TraceCheckUtils]: 283: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,704 INFO L290 TraceCheckUtils]: 282: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,705 INFO L290 TraceCheckUtils]: 281: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,705 INFO L290 TraceCheckUtils]: 280: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,705 INFO L290 TraceCheckUtils]: 279: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,705 INFO L290 TraceCheckUtils]: 278: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,706 INFO L290 TraceCheckUtils]: 277: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,706 INFO L290 TraceCheckUtils]: 276: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,706 INFO L290 TraceCheckUtils]: 275: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,706 INFO L290 TraceCheckUtils]: 274: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,707 INFO L290 TraceCheckUtils]: 273: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,707 INFO L290 TraceCheckUtils]: 272: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,707 INFO L290 TraceCheckUtils]: 271: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,707 INFO L290 TraceCheckUtils]: 270: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,707 INFO L290 TraceCheckUtils]: 269: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,708 INFO L290 TraceCheckUtils]: 268: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,708 INFO L290 TraceCheckUtils]: 267: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,708 INFO L290 TraceCheckUtils]: 266: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,708 INFO L290 TraceCheckUtils]: 265: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,709 INFO L290 TraceCheckUtils]: 264: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,709 INFO L290 TraceCheckUtils]: 263: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,709 INFO L290 TraceCheckUtils]: 262: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,709 INFO L290 TraceCheckUtils]: 261: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,710 INFO L290 TraceCheckUtils]: 260: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,710 INFO L290 TraceCheckUtils]: 259: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,710 INFO L290 TraceCheckUtils]: 258: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,710 INFO L290 TraceCheckUtils]: 257: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,710 INFO L290 TraceCheckUtils]: 256: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,711 INFO L290 TraceCheckUtils]: 255: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,711 INFO L290 TraceCheckUtils]: 254: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,711 INFO L290 TraceCheckUtils]: 253: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,711 INFO L290 TraceCheckUtils]: 252: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,712 INFO L290 TraceCheckUtils]: 251: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,712 INFO L290 TraceCheckUtils]: 250: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,712 INFO L290 TraceCheckUtils]: 249: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,712 INFO L290 TraceCheckUtils]: 248: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,713 INFO L290 TraceCheckUtils]: 247: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,713 INFO L290 TraceCheckUtils]: 246: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,713 INFO L290 TraceCheckUtils]: 245: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,713 INFO L290 TraceCheckUtils]: 244: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,713 INFO L290 TraceCheckUtils]: 243: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,714 INFO L290 TraceCheckUtils]: 242: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,714 INFO L290 TraceCheckUtils]: 241: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,714 INFO L290 TraceCheckUtils]: 240: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,714 INFO L290 TraceCheckUtils]: 239: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,715 INFO L290 TraceCheckUtils]: 238: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,715 INFO L290 TraceCheckUtils]: 237: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,715 INFO L290 TraceCheckUtils]: 236: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,715 INFO L290 TraceCheckUtils]: 235: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,716 INFO L290 TraceCheckUtils]: 234: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,716 INFO L290 TraceCheckUtils]: 233: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,716 INFO L290 TraceCheckUtils]: 232: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,716 INFO L290 TraceCheckUtils]: 231: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,717 INFO L290 TraceCheckUtils]: 230: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,717 INFO L290 TraceCheckUtils]: 229: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,717 INFO L290 TraceCheckUtils]: 228: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,717 INFO L290 TraceCheckUtils]: 227: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,717 INFO L290 TraceCheckUtils]: 226: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,718 INFO L290 TraceCheckUtils]: 225: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,718 INFO L290 TraceCheckUtils]: 224: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,718 INFO L290 TraceCheckUtils]: 223: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,718 INFO L290 TraceCheckUtils]: 222: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,719 INFO L290 TraceCheckUtils]: 221: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,719 INFO L290 TraceCheckUtils]: 220: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,719 INFO L290 TraceCheckUtils]: 219: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,719 INFO L290 TraceCheckUtils]: 218: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,720 INFO L290 TraceCheckUtils]: 217: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,720 INFO L290 TraceCheckUtils]: 216: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,720 INFO L290 TraceCheckUtils]: 215: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,720 INFO L290 TraceCheckUtils]: 214: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,720 INFO L290 TraceCheckUtils]: 213: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,721 INFO L290 TraceCheckUtils]: 212: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,721 INFO L290 TraceCheckUtils]: 211: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,721 INFO L290 TraceCheckUtils]: 210: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,721 INFO L290 TraceCheckUtils]: 209: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,722 INFO L290 TraceCheckUtils]: 208: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,722 INFO L290 TraceCheckUtils]: 207: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,722 INFO L290 TraceCheckUtils]: 206: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,722 INFO L290 TraceCheckUtils]: 205: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,723 INFO L290 TraceCheckUtils]: 204: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,723 INFO L290 TraceCheckUtils]: 203: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,723 INFO L290 TraceCheckUtils]: 202: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,723 INFO L290 TraceCheckUtils]: 201: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,724 INFO L290 TraceCheckUtils]: 200: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,724 INFO L290 TraceCheckUtils]: 199: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,724 INFO L290 TraceCheckUtils]: 198: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,724 INFO L290 TraceCheckUtils]: 197: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,724 INFO L290 TraceCheckUtils]: 196: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,725 INFO L290 TraceCheckUtils]: 195: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,725 INFO L290 TraceCheckUtils]: 194: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,725 INFO L290 TraceCheckUtils]: 193: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,725 INFO L290 TraceCheckUtils]: 192: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,726 INFO L290 TraceCheckUtils]: 191: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,726 INFO L290 TraceCheckUtils]: 190: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,726 INFO L290 TraceCheckUtils]: 189: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,726 INFO L290 TraceCheckUtils]: 188: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,727 INFO L290 TraceCheckUtils]: 187: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,727 INFO L290 TraceCheckUtils]: 186: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,727 INFO L290 TraceCheckUtils]: 185: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,727 INFO L290 TraceCheckUtils]: 184: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,727 INFO L290 TraceCheckUtils]: 183: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,728 INFO L290 TraceCheckUtils]: 182: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,728 INFO L290 TraceCheckUtils]: 181: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,728 INFO L290 TraceCheckUtils]: 180: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,728 INFO L290 TraceCheckUtils]: 179: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,729 INFO L290 TraceCheckUtils]: 178: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,729 INFO L290 TraceCheckUtils]: 177: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,729 INFO L290 TraceCheckUtils]: 176: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,729 INFO L290 TraceCheckUtils]: 175: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,730 INFO L290 TraceCheckUtils]: 174: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,730 INFO L290 TraceCheckUtils]: 173: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,730 INFO L290 TraceCheckUtils]: 172: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,730 INFO L290 TraceCheckUtils]: 171: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,730 INFO L290 TraceCheckUtils]: 170: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,731 INFO L290 TraceCheckUtils]: 169: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,731 INFO L290 TraceCheckUtils]: 168: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,731 INFO L290 TraceCheckUtils]: 167: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,731 INFO L290 TraceCheckUtils]: 166: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,732 INFO L290 TraceCheckUtils]: 165: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,732 INFO L290 TraceCheckUtils]: 164: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,732 INFO L290 TraceCheckUtils]: 163: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,732 INFO L290 TraceCheckUtils]: 162: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,733 INFO L290 TraceCheckUtils]: 161: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,733 INFO L290 TraceCheckUtils]: 160: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,733 INFO L290 TraceCheckUtils]: 159: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,733 INFO L290 TraceCheckUtils]: 158: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,733 INFO L290 TraceCheckUtils]: 157: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,734 INFO L290 TraceCheckUtils]: 156: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,734 INFO L290 TraceCheckUtils]: 155: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,734 INFO L290 TraceCheckUtils]: 154: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,734 INFO L290 TraceCheckUtils]: 153: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,735 INFO L290 TraceCheckUtils]: 152: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,735 INFO L290 TraceCheckUtils]: 151: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,735 INFO L290 TraceCheckUtils]: 150: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,735 INFO L290 TraceCheckUtils]: 149: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,736 INFO L290 TraceCheckUtils]: 148: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,736 INFO L290 TraceCheckUtils]: 147: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,736 INFO L290 TraceCheckUtils]: 146: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,736 INFO L290 TraceCheckUtils]: 145: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,736 INFO L290 TraceCheckUtils]: 144: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,737 INFO L290 TraceCheckUtils]: 143: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,737 INFO L290 TraceCheckUtils]: 142: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,737 INFO L290 TraceCheckUtils]: 141: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,737 INFO L290 TraceCheckUtils]: 140: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,738 INFO L290 TraceCheckUtils]: 139: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,738 INFO L290 TraceCheckUtils]: 138: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,738 INFO L290 TraceCheckUtils]: 137: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,738 INFO L290 TraceCheckUtils]: 136: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,739 INFO L290 TraceCheckUtils]: 135: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,739 INFO L290 TraceCheckUtils]: 134: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,739 INFO L290 TraceCheckUtils]: 133: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,739 INFO L290 TraceCheckUtils]: 132: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,739 INFO L290 TraceCheckUtils]: 131: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,740 INFO L290 TraceCheckUtils]: 130: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,740 INFO L290 TraceCheckUtils]: 129: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,740 INFO L290 TraceCheckUtils]: 128: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,740 INFO L290 TraceCheckUtils]: 127: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,741 INFO L290 TraceCheckUtils]: 126: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,741 INFO L290 TraceCheckUtils]: 125: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,741 INFO L290 TraceCheckUtils]: 124: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,741 INFO L290 TraceCheckUtils]: 123: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,742 INFO L290 TraceCheckUtils]: 122: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,742 INFO L290 TraceCheckUtils]: 121: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,742 INFO L290 TraceCheckUtils]: 120: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,742 INFO L290 TraceCheckUtils]: 119: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,742 INFO L290 TraceCheckUtils]: 118: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,743 INFO L290 TraceCheckUtils]: 117: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,743 INFO L290 TraceCheckUtils]: 116: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,743 INFO L290 TraceCheckUtils]: 115: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,743 INFO L290 TraceCheckUtils]: 114: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,744 INFO L290 TraceCheckUtils]: 113: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,744 INFO L290 TraceCheckUtils]: 112: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,744 INFO L290 TraceCheckUtils]: 111: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,744 INFO L290 TraceCheckUtils]: 110: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,745 INFO L290 TraceCheckUtils]: 109: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,745 INFO L290 TraceCheckUtils]: 108: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,745 INFO L290 TraceCheckUtils]: 107: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,745 INFO L290 TraceCheckUtils]: 106: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,746 INFO L290 TraceCheckUtils]: 105: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,747 INFO L290 TraceCheckUtils]: 104: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,747 INFO L290 TraceCheckUtils]: 103: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,747 INFO L290 TraceCheckUtils]: 102: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,747 INFO L290 TraceCheckUtils]: 101: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,748 INFO L290 TraceCheckUtils]: 100: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,748 INFO L290 TraceCheckUtils]: 99: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,748 INFO L290 TraceCheckUtils]: 98: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,748 INFO L290 TraceCheckUtils]: 97: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,749 INFO L290 TraceCheckUtils]: 96: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,749 INFO L290 TraceCheckUtils]: 95: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,749 INFO L290 TraceCheckUtils]: 94: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,749 INFO L290 TraceCheckUtils]: 93: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,749 INFO L290 TraceCheckUtils]: 92: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,750 INFO L290 TraceCheckUtils]: 91: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,750 INFO L290 TraceCheckUtils]: 90: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,750 INFO L290 TraceCheckUtils]: 89: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,750 INFO L290 TraceCheckUtils]: 88: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,751 INFO L290 TraceCheckUtils]: 87: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,751 INFO L290 TraceCheckUtils]: 86: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,751 INFO L290 TraceCheckUtils]: 85: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,751 INFO L290 TraceCheckUtils]: 84: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,752 INFO L290 TraceCheckUtils]: 83: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,752 INFO L290 TraceCheckUtils]: 82: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,752 INFO L290 TraceCheckUtils]: 81: Hoare triple {58893#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-08 03:36:58,753 INFO L290 TraceCheckUtils]: 80: Hoare triple {58883#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58893#(<= 6 main_~j~0)} is VALID [2022-04-08 03:36:58,753 INFO L290 TraceCheckUtils]: 79: Hoare triple {58883#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58883#(<= 5 main_~j~0)} is VALID [2022-04-08 03:36:58,753 INFO L290 TraceCheckUtils]: 78: Hoare triple {58883#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58883#(<= 5 main_~j~0)} is VALID [2022-04-08 03:36:58,754 INFO L290 TraceCheckUtils]: 77: Hoare triple {58873#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58883#(<= 5 main_~j~0)} is VALID [2022-04-08 03:36:58,754 INFO L290 TraceCheckUtils]: 76: Hoare triple {58873#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58873#(<= 4 main_~j~0)} is VALID [2022-04-08 03:36:58,754 INFO L290 TraceCheckUtils]: 75: Hoare triple {58873#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58873#(<= 4 main_~j~0)} is VALID [2022-04-08 03:36:58,754 INFO L290 TraceCheckUtils]: 74: Hoare triple {58863#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58873#(<= 4 main_~j~0)} is VALID [2022-04-08 03:36:58,755 INFO L290 TraceCheckUtils]: 73: Hoare triple {58863#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58863#(<= 3 main_~j~0)} is VALID [2022-04-08 03:36:58,755 INFO L290 TraceCheckUtils]: 72: Hoare triple {58863#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58863#(<= 3 main_~j~0)} is VALID [2022-04-08 03:36:58,755 INFO L290 TraceCheckUtils]: 71: Hoare triple {58853#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58863#(<= 3 main_~j~0)} is VALID [2022-04-08 03:36:58,755 INFO L290 TraceCheckUtils]: 70: Hoare triple {58853#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58853#(<= 2 main_~j~0)} is VALID [2022-04-08 03:36:58,756 INFO L290 TraceCheckUtils]: 69: Hoare triple {58853#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58853#(<= 2 main_~j~0)} is VALID [2022-04-08 03:36:58,756 INFO L290 TraceCheckUtils]: 68: Hoare triple {58843#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58853#(<= 2 main_~j~0)} is VALID [2022-04-08 03:36:58,756 INFO L290 TraceCheckUtils]: 67: Hoare triple {58843#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58843#(<= 1 main_~j~0)} is VALID [2022-04-08 03:36:58,756 INFO L290 TraceCheckUtils]: 66: Hoare triple {58843#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58843#(<= 1 main_~j~0)} is VALID [2022-04-08 03:36:58,757 INFO L290 TraceCheckUtils]: 65: Hoare triple {58833#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58843#(<= 1 main_~j~0)} is VALID [2022-04-08 03:36:58,757 INFO L290 TraceCheckUtils]: 64: Hoare triple {58833#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58833#(<= 0 main_~j~0)} is VALID [2022-04-08 03:36:58,757 INFO L290 TraceCheckUtils]: 63: Hoare triple {58833#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58833#(<= 0 main_~j~0)} is VALID [2022-04-08 03:36:58,758 INFO L290 TraceCheckUtils]: 62: Hoare triple {60798#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58833#(<= 0 main_~j~0)} is VALID [2022-04-08 03:36:58,758 INFO L290 TraceCheckUtils]: 61: Hoare triple {60798#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60798#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:36:58,758 INFO L290 TraceCheckUtils]: 60: Hoare triple {60798#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60798#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:36:58,758 INFO L290 TraceCheckUtils]: 59: Hoare triple {60808#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60798#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-08 03:36:58,759 INFO L290 TraceCheckUtils]: 58: Hoare triple {60808#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60808#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:36:58,759 INFO L290 TraceCheckUtils]: 57: Hoare triple {60808#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60808#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:36:58,760 INFO L290 TraceCheckUtils]: 56: Hoare triple {60818#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60808#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-08 03:36:58,760 INFO L290 TraceCheckUtils]: 55: Hoare triple {60818#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60818#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:36:58,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {60818#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60818#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:36:58,761 INFO L290 TraceCheckUtils]: 53: Hoare triple {60828#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60818#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-08 03:36:58,761 INFO L290 TraceCheckUtils]: 52: Hoare triple {60828#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60828#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:36:58,761 INFO L290 TraceCheckUtils]: 51: Hoare triple {60828#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60828#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:36:58,761 INFO L290 TraceCheckUtils]: 50: Hoare triple {60838#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60828#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-08 03:36:58,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {60838#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60838#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:36:58,762 INFO L290 TraceCheckUtils]: 48: Hoare triple {60838#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60838#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:36:58,762 INFO L290 TraceCheckUtils]: 47: Hoare triple {60848#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60838#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-08 03:36:58,763 INFO L290 TraceCheckUtils]: 46: Hoare triple {60848#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60848#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:36:58,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {60848#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60848#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:36:58,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {60858#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60848#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-08 03:36:58,764 INFO L290 TraceCheckUtils]: 43: Hoare triple {60858#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60858#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:36:58,764 INFO L290 TraceCheckUtils]: 42: Hoare triple {60858#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60858#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:36:58,764 INFO L290 TraceCheckUtils]: 41: Hoare triple {60868#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60858#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-08 03:36:58,764 INFO L290 TraceCheckUtils]: 40: Hoare triple {60868#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60868#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:36:58,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {60868#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60868#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:36:58,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {60878#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60868#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-08 03:36:58,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {60878#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60878#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:36:58,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {60878#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60878#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:36:58,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {60888#(<= 0 (+ main_~j~0 10))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60878#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-08 03:36:58,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {60888#(<= 0 (+ main_~j~0 10))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60888#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 03:36:58,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {60888#(<= 0 (+ main_~j~0 10))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60888#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 03:36:58,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {60898#(<= 0 (+ main_~j~0 11))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60888#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-08 03:36:58,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {60898#(<= 0 (+ main_~j~0 11))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60898#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 03:36:58,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {60898#(<= 0 (+ main_~j~0 11))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60898#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 03:36:58,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {60908#(<= 0 (+ main_~j~0 12))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60898#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-08 03:36:58,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {60908#(<= 0 (+ main_~j~0 12))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60908#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 03:36:58,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {60908#(<= 0 (+ main_~j~0 12))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60908#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 03:36:58,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {60918#(<= 0 (+ main_~j~0 13))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60908#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-08 03:36:58,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {60918#(<= 0 (+ main_~j~0 13))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60918#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 03:36:58,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {60918#(<= 0 (+ main_~j~0 13))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60918#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 03:36:58,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {60918#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-08 03:36:58,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {58747#true} ~i~0 := 0; {58747#true} is VALID [2022-04-08 03:36:58,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {58747#true} assume !(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 03:36:58,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 03:36:58,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {58747#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {58747#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {58747#true} call #t~ret22 := main(); {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58747#true} {58747#true} #107#return; {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {58747#true} assume true; {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {58747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {58747#true} is VALID [2022-04-08 03:36:58,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {58747#true} call ULTIMATE.init(); {58747#true} is VALID [2022-04-08 03:36:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 15471 backedges. 537 proven. 4829 refuted. 0 times theorem prover too weak. 10105 trivial. 0 not checked. [2022-04-08 03:36:58,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781123028] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:36:58,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:36:58,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 30, 30] total 60 [2022-04-08 03:36:58,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:36:58,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1461298025] [2022-04-08 03:36:58,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1461298025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:36:58,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:36:58,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 03:36:58,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331529756] [2022-04-08 03:36:58,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:36:58,772 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 365 [2022-04-08 03:36:58,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:36:58,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:58,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:58,801 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 03:36:58,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:58,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 03:36:58,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=2668, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 03:36:58,802 INFO L87 Difference]: Start difference. First operand 370 states and 479 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:37:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:37:02,250 INFO L93 Difference]: Finished difference Result 614 states and 798 transitions. [2022-04-08 03:37:02,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 03:37:02,250 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 365 [2022-04-08 03:37:02,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:37:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:37:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2022-04-08 03:37:02,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:37:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2022-04-08 03:37:02,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 182 transitions. [2022-04-08 03:37:02,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:37:02,428 INFO L225 Difference]: With dead ends: 614 [2022-04-08 03:37:02,428 INFO L226 Difference]: Without dead ends: 603 [2022-04-08 03:37:02,428 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-08 03:37:02,429 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 259 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:37:02,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 42 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:37:02,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-08 03:37:04,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 373. [2022-04-08 03:37:04,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:37:04,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 373 states, 367 states have (on average 1.2997275204359673) internal successors, (477), 367 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:37:04,118 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 373 states, 367 states have (on average 1.2997275204359673) internal successors, (477), 367 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:37:04,118 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 373 states, 367 states have (on average 1.2997275204359673) internal successors, (477), 367 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:37:04,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:37:04,130 INFO L93 Difference]: Finished difference Result 603 states and 786 transitions. [2022-04-08 03:37:04,130 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 786 transitions. [2022-04-08 03:37:04,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:37:04,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:37:04,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 373 states, 367 states have (on average 1.2997275204359673) internal successors, (477), 367 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 603 states. [2022-04-08 03:37:04,131 INFO L87 Difference]: Start difference. First operand has 373 states, 367 states have (on average 1.2997275204359673) internal successors, (477), 367 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 603 states. [2022-04-08 03:37:04,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:37:04,142 INFO L93 Difference]: Finished difference Result 603 states and 786 transitions. [2022-04-08 03:37:04,142 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 786 transitions. [2022-04-08 03:37:04,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:37:04,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:37:04,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:37:04,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:37:04,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 367 states have (on average 1.2997275204359673) internal successors, (477), 367 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:37:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 482 transitions. [2022-04-08 03:37:04,149 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 482 transitions. Word has length 365 [2022-04-08 03:37:04,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:37:04,149 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 482 transitions. [2022-04-08 03:37:04,149 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:37:04,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 373 states and 482 transitions. [2022-04-08 03:37:04,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 482 edges. 482 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:37:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 482 transitions. [2022-04-08 03:37:04,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2022-04-08 03:37:04,977 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:37:04,977 INFO L499 BasicCegarLoop]: trace histogram [100, 100, 100, 7, 7, 7, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:37:04,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-04-08 03:37:05,177 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-08 03:37:05,178 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:37:05,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:37:05,178 INFO L85 PathProgramCache]: Analyzing trace with hash -382120294, now seen corresponding path program 65 times [2022-04-08 03:37:05,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:37:05,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1113806735] [2022-04-08 03:37:05,181 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:37:05,182 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:37:05,182 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:37:05,182 INFO L85 PathProgramCache]: Analyzing trace with hash -382120294, now seen corresponding path program 66 times [2022-04-08 03:37:05,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:37:05,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134668425] [2022-04-08 03:37:05,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:37:05,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:37:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:37:05,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:37:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:37:05,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {64209#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {64195#true} is VALID [2022-04-08 03:37:05,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {64195#true} assume true; {64195#true} is VALID [2022-04-08 03:37:05,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64195#true} {64195#true} #107#return; {64195#true} is VALID [2022-04-08 03:37:05,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {64195#true} call ULTIMATE.init(); {64209#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:37:05,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {64209#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {64195#true} is VALID [2022-04-08 03:37:05,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {64195#true} assume true; {64195#true} is VALID [2022-04-08 03:37:05,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64195#true} {64195#true} #107#return; {64195#true} is VALID [2022-04-08 03:37:05,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {64195#true} call #t~ret22 := main(); {64195#true} is VALID [2022-04-08 03:37:05,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {64195#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {64200#(<= 20 main_~edgecount~0)} ~i~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,523 INFO L290 TraceCheckUtils]: 36: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,523 INFO L290 TraceCheckUtils]: 37: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,523 INFO L290 TraceCheckUtils]: 38: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,524 INFO L290 TraceCheckUtils]: 39: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,524 INFO L290 TraceCheckUtils]: 40: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,524 INFO L290 TraceCheckUtils]: 41: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,524 INFO L290 TraceCheckUtils]: 42: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,525 INFO L290 TraceCheckUtils]: 43: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,525 INFO L290 TraceCheckUtils]: 45: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,525 INFO L290 TraceCheckUtils]: 46: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,525 INFO L290 TraceCheckUtils]: 47: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,526 INFO L290 TraceCheckUtils]: 48: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,526 INFO L290 TraceCheckUtils]: 49: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,526 INFO L290 TraceCheckUtils]: 50: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,526 INFO L290 TraceCheckUtils]: 51: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,527 INFO L290 TraceCheckUtils]: 52: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,527 INFO L290 TraceCheckUtils]: 53: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,527 INFO L290 TraceCheckUtils]: 54: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,527 INFO L290 TraceCheckUtils]: 55: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,528 INFO L290 TraceCheckUtils]: 56: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,528 INFO L290 TraceCheckUtils]: 57: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,528 INFO L290 TraceCheckUtils]: 58: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,528 INFO L290 TraceCheckUtils]: 59: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,528 INFO L290 TraceCheckUtils]: 60: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,529 INFO L290 TraceCheckUtils]: 61: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,529 INFO L290 TraceCheckUtils]: 62: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,529 INFO L290 TraceCheckUtils]: 63: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,529 INFO L290 TraceCheckUtils]: 64: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,530 INFO L290 TraceCheckUtils]: 65: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,530 INFO L290 TraceCheckUtils]: 66: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,530 INFO L290 TraceCheckUtils]: 67: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,530 INFO L290 TraceCheckUtils]: 68: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,530 INFO L290 TraceCheckUtils]: 69: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,531 INFO L290 TraceCheckUtils]: 70: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,531 INFO L290 TraceCheckUtils]: 71: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,531 INFO L290 TraceCheckUtils]: 72: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,531 INFO L290 TraceCheckUtils]: 73: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,531 INFO L290 TraceCheckUtils]: 74: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,532 INFO L290 TraceCheckUtils]: 75: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,532 INFO L290 TraceCheckUtils]: 76: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,532 INFO L290 TraceCheckUtils]: 77: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,532 INFO L290 TraceCheckUtils]: 78: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,533 INFO L290 TraceCheckUtils]: 79: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,533 INFO L290 TraceCheckUtils]: 80: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,533 INFO L290 TraceCheckUtils]: 81: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,533 INFO L290 TraceCheckUtils]: 82: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,533 INFO L290 TraceCheckUtils]: 83: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,534 INFO L290 TraceCheckUtils]: 84: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,534 INFO L290 TraceCheckUtils]: 85: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,534 INFO L290 TraceCheckUtils]: 86: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,534 INFO L290 TraceCheckUtils]: 87: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,535 INFO L290 TraceCheckUtils]: 88: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,535 INFO L290 TraceCheckUtils]: 89: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,535 INFO L290 TraceCheckUtils]: 90: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,535 INFO L290 TraceCheckUtils]: 91: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,535 INFO L290 TraceCheckUtils]: 92: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,536 INFO L290 TraceCheckUtils]: 93: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,536 INFO L290 TraceCheckUtils]: 94: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,536 INFO L290 TraceCheckUtils]: 95: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,536 INFO L290 TraceCheckUtils]: 96: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,537 INFO L290 TraceCheckUtils]: 97: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,537 INFO L290 TraceCheckUtils]: 98: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,537 INFO L290 TraceCheckUtils]: 99: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,537 INFO L290 TraceCheckUtils]: 100: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,537 INFO L290 TraceCheckUtils]: 101: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,538 INFO L290 TraceCheckUtils]: 102: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,538 INFO L290 TraceCheckUtils]: 103: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,538 INFO L290 TraceCheckUtils]: 104: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,538 INFO L290 TraceCheckUtils]: 105: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,539 INFO L290 TraceCheckUtils]: 106: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,539 INFO L290 TraceCheckUtils]: 107: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,539 INFO L290 TraceCheckUtils]: 108: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,539 INFO L290 TraceCheckUtils]: 109: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,539 INFO L290 TraceCheckUtils]: 110: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,540 INFO L290 TraceCheckUtils]: 111: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,540 INFO L290 TraceCheckUtils]: 112: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,540 INFO L290 TraceCheckUtils]: 113: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,540 INFO L290 TraceCheckUtils]: 114: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,540 INFO L290 TraceCheckUtils]: 115: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,541 INFO L290 TraceCheckUtils]: 116: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,541 INFO L290 TraceCheckUtils]: 117: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,541 INFO L290 TraceCheckUtils]: 118: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,541 INFO L290 TraceCheckUtils]: 119: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,542 INFO L290 TraceCheckUtils]: 120: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,542 INFO L290 TraceCheckUtils]: 121: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,542 INFO L290 TraceCheckUtils]: 122: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,542 INFO L290 TraceCheckUtils]: 123: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,542 INFO L290 TraceCheckUtils]: 124: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,543 INFO L290 TraceCheckUtils]: 125: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,543 INFO L290 TraceCheckUtils]: 126: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,543 INFO L290 TraceCheckUtils]: 127: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,543 INFO L290 TraceCheckUtils]: 128: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,543 INFO L290 TraceCheckUtils]: 129: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,544 INFO L290 TraceCheckUtils]: 130: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,544 INFO L290 TraceCheckUtils]: 131: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,544 INFO L290 TraceCheckUtils]: 132: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,544 INFO L290 TraceCheckUtils]: 133: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,544 INFO L290 TraceCheckUtils]: 134: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,545 INFO L290 TraceCheckUtils]: 135: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,545 INFO L290 TraceCheckUtils]: 136: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,545 INFO L290 TraceCheckUtils]: 137: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,545 INFO L290 TraceCheckUtils]: 138: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,545 INFO L290 TraceCheckUtils]: 139: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,546 INFO L290 TraceCheckUtils]: 140: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,546 INFO L290 TraceCheckUtils]: 141: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,546 INFO L290 TraceCheckUtils]: 142: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,546 INFO L290 TraceCheckUtils]: 143: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,546 INFO L290 TraceCheckUtils]: 144: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,547 INFO L290 TraceCheckUtils]: 145: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,547 INFO L290 TraceCheckUtils]: 146: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,547 INFO L290 TraceCheckUtils]: 147: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,547 INFO L290 TraceCheckUtils]: 148: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,548 INFO L290 TraceCheckUtils]: 149: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,548 INFO L290 TraceCheckUtils]: 150: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,548 INFO L290 TraceCheckUtils]: 151: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,548 INFO L290 TraceCheckUtils]: 152: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,548 INFO L290 TraceCheckUtils]: 153: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,549 INFO L290 TraceCheckUtils]: 154: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,549 INFO L290 TraceCheckUtils]: 155: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,549 INFO L290 TraceCheckUtils]: 156: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,549 INFO L290 TraceCheckUtils]: 157: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,549 INFO L290 TraceCheckUtils]: 158: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,550 INFO L290 TraceCheckUtils]: 159: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,550 INFO L290 TraceCheckUtils]: 160: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,550 INFO L290 TraceCheckUtils]: 161: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,550 INFO L290 TraceCheckUtils]: 162: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,550 INFO L290 TraceCheckUtils]: 163: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,551 INFO L290 TraceCheckUtils]: 164: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,551 INFO L290 TraceCheckUtils]: 165: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,551 INFO L290 TraceCheckUtils]: 166: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,551 INFO L290 TraceCheckUtils]: 167: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,552 INFO L290 TraceCheckUtils]: 168: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,552 INFO L290 TraceCheckUtils]: 169: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,552 INFO L290 TraceCheckUtils]: 170: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,552 INFO L290 TraceCheckUtils]: 171: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,552 INFO L290 TraceCheckUtils]: 172: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,553 INFO L290 TraceCheckUtils]: 173: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,553 INFO L290 TraceCheckUtils]: 174: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,553 INFO L290 TraceCheckUtils]: 175: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,553 INFO L290 TraceCheckUtils]: 176: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,553 INFO L290 TraceCheckUtils]: 177: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,554 INFO L290 TraceCheckUtils]: 178: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,554 INFO L290 TraceCheckUtils]: 179: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,554 INFO L290 TraceCheckUtils]: 180: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,554 INFO L290 TraceCheckUtils]: 181: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,554 INFO L290 TraceCheckUtils]: 182: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,555 INFO L290 TraceCheckUtils]: 183: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,555 INFO L290 TraceCheckUtils]: 184: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,555 INFO L290 TraceCheckUtils]: 185: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,555 INFO L290 TraceCheckUtils]: 186: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,555 INFO L290 TraceCheckUtils]: 187: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,556 INFO L290 TraceCheckUtils]: 188: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,556 INFO L290 TraceCheckUtils]: 189: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,556 INFO L290 TraceCheckUtils]: 190: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,556 INFO L290 TraceCheckUtils]: 191: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,556 INFO L290 TraceCheckUtils]: 192: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,557 INFO L290 TraceCheckUtils]: 193: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,557 INFO L290 TraceCheckUtils]: 194: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,557 INFO L290 TraceCheckUtils]: 195: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,557 INFO L290 TraceCheckUtils]: 196: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,558 INFO L290 TraceCheckUtils]: 197: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,558 INFO L290 TraceCheckUtils]: 198: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,558 INFO L290 TraceCheckUtils]: 199: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,558 INFO L290 TraceCheckUtils]: 200: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,558 INFO L290 TraceCheckUtils]: 201: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,559 INFO L290 TraceCheckUtils]: 202: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,559 INFO L290 TraceCheckUtils]: 203: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,559 INFO L290 TraceCheckUtils]: 204: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,559 INFO L290 TraceCheckUtils]: 205: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,559 INFO L290 TraceCheckUtils]: 206: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,560 INFO L290 TraceCheckUtils]: 207: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,560 INFO L290 TraceCheckUtils]: 208: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,560 INFO L290 TraceCheckUtils]: 209: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,560 INFO L290 TraceCheckUtils]: 210: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,560 INFO L290 TraceCheckUtils]: 211: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,561 INFO L290 TraceCheckUtils]: 212: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,561 INFO L290 TraceCheckUtils]: 213: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,561 INFO L290 TraceCheckUtils]: 214: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,561 INFO L290 TraceCheckUtils]: 215: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,561 INFO L290 TraceCheckUtils]: 216: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,562 INFO L290 TraceCheckUtils]: 217: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,562 INFO L290 TraceCheckUtils]: 218: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,562 INFO L290 TraceCheckUtils]: 219: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,562 INFO L290 TraceCheckUtils]: 220: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,563 INFO L290 TraceCheckUtils]: 221: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,563 INFO L290 TraceCheckUtils]: 222: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,563 INFO L290 TraceCheckUtils]: 223: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,563 INFO L290 TraceCheckUtils]: 224: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,563 INFO L290 TraceCheckUtils]: 225: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,564 INFO L290 TraceCheckUtils]: 226: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,564 INFO L290 TraceCheckUtils]: 227: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,564 INFO L290 TraceCheckUtils]: 228: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,564 INFO L290 TraceCheckUtils]: 229: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,564 INFO L290 TraceCheckUtils]: 230: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,565 INFO L290 TraceCheckUtils]: 231: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,565 INFO L290 TraceCheckUtils]: 232: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,565 INFO L290 TraceCheckUtils]: 233: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,565 INFO L290 TraceCheckUtils]: 234: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,565 INFO L290 TraceCheckUtils]: 235: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,566 INFO L290 TraceCheckUtils]: 236: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,566 INFO L290 TraceCheckUtils]: 237: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,566 INFO L290 TraceCheckUtils]: 238: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,566 INFO L290 TraceCheckUtils]: 239: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,566 INFO L290 TraceCheckUtils]: 240: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,567 INFO L290 TraceCheckUtils]: 241: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,567 INFO L290 TraceCheckUtils]: 242: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,567 INFO L290 TraceCheckUtils]: 243: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,567 INFO L290 TraceCheckUtils]: 244: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,568 INFO L290 TraceCheckUtils]: 245: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,568 INFO L290 TraceCheckUtils]: 246: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,568 INFO L290 TraceCheckUtils]: 247: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,568 INFO L290 TraceCheckUtils]: 248: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,568 INFO L290 TraceCheckUtils]: 249: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,569 INFO L290 TraceCheckUtils]: 250: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,569 INFO L290 TraceCheckUtils]: 251: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,569 INFO L290 TraceCheckUtils]: 252: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,569 INFO L290 TraceCheckUtils]: 253: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,569 INFO L290 TraceCheckUtils]: 254: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,570 INFO L290 TraceCheckUtils]: 255: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,570 INFO L290 TraceCheckUtils]: 256: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,570 INFO L290 TraceCheckUtils]: 257: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,570 INFO L290 TraceCheckUtils]: 258: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,570 INFO L290 TraceCheckUtils]: 259: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,571 INFO L290 TraceCheckUtils]: 260: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,571 INFO L290 TraceCheckUtils]: 261: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,571 INFO L290 TraceCheckUtils]: 262: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,571 INFO L290 TraceCheckUtils]: 263: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,571 INFO L290 TraceCheckUtils]: 264: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,572 INFO L290 TraceCheckUtils]: 265: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,572 INFO L290 TraceCheckUtils]: 266: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,572 INFO L290 TraceCheckUtils]: 267: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,572 INFO L290 TraceCheckUtils]: 268: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,572 INFO L290 TraceCheckUtils]: 269: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,573 INFO L290 TraceCheckUtils]: 270: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,573 INFO L290 TraceCheckUtils]: 271: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,573 INFO L290 TraceCheckUtils]: 272: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,573 INFO L290 TraceCheckUtils]: 273: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,573 INFO L290 TraceCheckUtils]: 274: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,574 INFO L290 TraceCheckUtils]: 275: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,574 INFO L290 TraceCheckUtils]: 276: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,574 INFO L290 TraceCheckUtils]: 277: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,574 INFO L290 TraceCheckUtils]: 278: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,575 INFO L290 TraceCheckUtils]: 279: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,575 INFO L290 TraceCheckUtils]: 280: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,575 INFO L290 TraceCheckUtils]: 281: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,575 INFO L290 TraceCheckUtils]: 282: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,575 INFO L290 TraceCheckUtils]: 283: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,576 INFO L290 TraceCheckUtils]: 284: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,576 INFO L290 TraceCheckUtils]: 285: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,576 INFO L290 TraceCheckUtils]: 286: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,576 INFO L290 TraceCheckUtils]: 287: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,576 INFO L290 TraceCheckUtils]: 288: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,577 INFO L290 TraceCheckUtils]: 289: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,577 INFO L290 TraceCheckUtils]: 290: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,577 INFO L290 TraceCheckUtils]: 291: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,577 INFO L290 TraceCheckUtils]: 292: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,577 INFO L290 TraceCheckUtils]: 293: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,578 INFO L290 TraceCheckUtils]: 294: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,578 INFO L290 TraceCheckUtils]: 295: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,578 INFO L290 TraceCheckUtils]: 296: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,578 INFO L290 TraceCheckUtils]: 297: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,578 INFO L290 TraceCheckUtils]: 298: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,579 INFO L290 TraceCheckUtils]: 299: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,579 INFO L290 TraceCheckUtils]: 300: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,579 INFO L290 TraceCheckUtils]: 301: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,579 INFO L290 TraceCheckUtils]: 302: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,579 INFO L290 TraceCheckUtils]: 303: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,580 INFO L290 TraceCheckUtils]: 304: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,580 INFO L290 TraceCheckUtils]: 305: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,580 INFO L290 TraceCheckUtils]: 306: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,580 INFO L290 TraceCheckUtils]: 307: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,581 INFO L290 TraceCheckUtils]: 308: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,581 INFO L290 TraceCheckUtils]: 309: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,581 INFO L290 TraceCheckUtils]: 310: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,581 INFO L290 TraceCheckUtils]: 311: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,581 INFO L290 TraceCheckUtils]: 312: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,582 INFO L290 TraceCheckUtils]: 313: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,582 INFO L290 TraceCheckUtils]: 314: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,582 INFO L290 TraceCheckUtils]: 315: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,582 INFO L290 TraceCheckUtils]: 316: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,582 INFO L290 TraceCheckUtils]: 317: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,583 INFO L290 TraceCheckUtils]: 318: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,583 INFO L290 TraceCheckUtils]: 319: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,583 INFO L290 TraceCheckUtils]: 320: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,583 INFO L290 TraceCheckUtils]: 321: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,583 INFO L290 TraceCheckUtils]: 322: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,584 INFO L290 TraceCheckUtils]: 323: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,584 INFO L290 TraceCheckUtils]: 324: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,584 INFO L290 TraceCheckUtils]: 325: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,584 INFO L290 TraceCheckUtils]: 326: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,584 INFO L290 TraceCheckUtils]: 327: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,585 INFO L290 TraceCheckUtils]: 328: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,585 INFO L290 TraceCheckUtils]: 329: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,585 INFO L290 TraceCheckUtils]: 330: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,585 INFO L290 TraceCheckUtils]: 331: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,585 INFO L290 TraceCheckUtils]: 332: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,586 INFO L290 TraceCheckUtils]: 333: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,586 INFO L290 TraceCheckUtils]: 334: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,586 INFO L290 TraceCheckUtils]: 335: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,586 INFO L290 TraceCheckUtils]: 336: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,586 INFO L290 TraceCheckUtils]: 337: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,587 INFO L290 TraceCheckUtils]: 338: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-08 03:37:05,587 INFO L290 TraceCheckUtils]: 339: Hoare triple {64200#(<= 20 main_~edgecount~0)} ~i~0 := 0; {64201#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 03:37:05,587 INFO L290 TraceCheckUtils]: 340: Hoare triple {64201#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64201#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 03:37:05,588 INFO L290 TraceCheckUtils]: 341: Hoare triple {64201#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64201#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-08 03:37:05,588 INFO L290 TraceCheckUtils]: 342: Hoare triple {64201#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64202#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,588 INFO L290 TraceCheckUtils]: 343: Hoare triple {64202#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64202#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,589 INFO L290 TraceCheckUtils]: 344: Hoare triple {64202#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64202#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,589 INFO L290 TraceCheckUtils]: 345: Hoare triple {64202#(<= (+ 19 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64203#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,589 INFO L290 TraceCheckUtils]: 346: Hoare triple {64203#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64203#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,589 INFO L290 TraceCheckUtils]: 347: Hoare triple {64203#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64203#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,590 INFO L290 TraceCheckUtils]: 348: Hoare triple {64203#(<= (+ main_~i~0 18) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64204#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,590 INFO L290 TraceCheckUtils]: 349: Hoare triple {64204#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64204#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,590 INFO L290 TraceCheckUtils]: 350: Hoare triple {64204#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64204#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,591 INFO L290 TraceCheckUtils]: 351: Hoare triple {64204#(<= (+ main_~i~0 17) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64205#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,591 INFO L290 TraceCheckUtils]: 352: Hoare triple {64205#(<= (+ main_~i~0 16) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64205#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,591 INFO L290 TraceCheckUtils]: 353: Hoare triple {64205#(<= (+ main_~i~0 16) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64205#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,591 INFO L290 TraceCheckUtils]: 354: Hoare triple {64205#(<= (+ main_~i~0 16) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64206#(<= (+ main_~i~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,592 INFO L290 TraceCheckUtils]: 355: Hoare triple {64206#(<= (+ main_~i~0 15) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64206#(<= (+ main_~i~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,592 INFO L290 TraceCheckUtils]: 356: Hoare triple {64206#(<= (+ main_~i~0 15) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64206#(<= (+ main_~i~0 15) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,592 INFO L290 TraceCheckUtils]: 357: Hoare triple {64206#(<= (+ main_~i~0 15) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64207#(<= (+ main_~i~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,592 INFO L290 TraceCheckUtils]: 358: Hoare triple {64207#(<= (+ main_~i~0 14) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64207#(<= (+ main_~i~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,593 INFO L290 TraceCheckUtils]: 359: Hoare triple {64207#(<= (+ main_~i~0 14) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64207#(<= (+ main_~i~0 14) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,593 INFO L290 TraceCheckUtils]: 360: Hoare triple {64207#(<= (+ main_~i~0 14) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64208#(<= (+ main_~i~0 13) main_~edgecount~0)} is VALID [2022-04-08 03:37:05,593 INFO L290 TraceCheckUtils]: 361: Hoare triple {64208#(<= (+ main_~i~0 13) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {64196#false} is VALID [2022-04-08 03:37:05,593 INFO L290 TraceCheckUtils]: 362: Hoare triple {64196#false} ~i~0 := 0; {64196#false} is VALID [2022-04-08 03:37:05,593 INFO L290 TraceCheckUtils]: 363: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-08 03:37:05,593 INFO L272 TraceCheckUtils]: 364: Hoare triple {64196#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {64196#false} is VALID [2022-04-08 03:37:05,593 INFO L290 TraceCheckUtils]: 365: Hoare triple {64196#false} ~cond := #in~cond; {64196#false} is VALID [2022-04-08 03:37:05,593 INFO L290 TraceCheckUtils]: 366: Hoare triple {64196#false} assume 0 == ~cond; {64196#false} is VALID [2022-04-08 03:37:05,593 INFO L290 TraceCheckUtils]: 367: Hoare triple {64196#false} assume !false; {64196#false} is VALID [2022-04-08 03:37:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 15490 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-08 03:37:05,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:37:05,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134668425] [2022-04-08 03:37:05,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134668425] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:37:05,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501493922] [2022-04-08 03:37:05,595 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:37:05,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:37:05,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:37:05,596 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:37:05,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-08 03:37:16,656 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 03:37:16,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:37:16,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-08 03:37:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:37:16,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:37:16,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-04-08 03:37:17,003 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-08 03:37:17,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2022-04-08 03:37:17,174 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-08 03:37:17,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2022-04-08 03:37:17,320 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-08 03:37:17,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2022-04-08 03:37:17,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:37:17,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:37:17,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 03:37:17,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 03:37:17,518 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-08 03:37:17,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 58 [2022-04-08 03:37:17,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:37:17,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:37:17,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:37:17,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 03:37:17,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 03:37:17,911 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-08 03:37:17,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 73 [2022-04-08 03:37:19,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 03:37:19,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:37:19,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:37:19,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:37:19,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:37:19,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 03:37:19,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 03:37:19,061 INFO L356 Elim1Store]: treesize reduction 99, result has 19.5 percent of original size [2022-04-08 03:37:19,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 91 [2022-04-08 03:37:19,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:37:19,752 INFO L356 Elim1Store]: treesize reduction 50, result has 35.1 percent of original size [2022-04-08 03:37:19,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 79 treesize of output 61 [2022-04-08 03:37:20,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {64195#true} call ULTIMATE.init(); {64195#true} is VALID [2022-04-08 03:37:20,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {64195#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {64195#true} is VALID [2022-04-08 03:37:20,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {64195#true} assume true; {64195#true} is VALID [2022-04-08 03:37:20,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64195#true} {64195#true} #107#return; {64195#true} is VALID [2022-04-08 03:37:20,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {64195#true} call #t~ret22 := main(); {64195#true} is VALID [2022-04-08 03:37:20,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {64195#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {64228#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {64228#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {64228#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {64228#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64228#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {64228#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64263#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) ~INFINITY~0) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {64263#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) ~INFINITY~0) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64267#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4))) ~INFINITY~0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {64267#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4))) ~INFINITY~0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {64271#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4))) ~INFINITY~0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (< main_~i~0 main_~nodecount~0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {64271#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4))) ~INFINITY~0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (< main_~i~0 main_~nodecount~0) (= |main_~#Source~0.offset| 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64275#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (< main_~i~0 main_~nodecount~0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {64275#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (< main_~i~0 main_~nodecount~0) (= |main_~#Source~0.offset| 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64279#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (<= main_~i~0 (+ v_main_~i~0_542 1)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (< v_main_~i~0_542 main_~nodecount~0))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {64279#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (<= main_~i~0 (+ v_main_~i~0_542 1)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (< v_main_~i~0_542 main_~nodecount~0))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {64283#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {64283#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} ~i~0 := 0; {64283#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {64283#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64290#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {64290#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64294#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0) (<= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|))))} is VALID [2022-04-08 03:37:20,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {64294#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0) (<= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|))))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64290#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {64290#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64301#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= main_~j~0 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-08 03:37:20,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {64301#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= main_~j~0 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64305#(and (<= |main_#t~mem11| |main_#t~mem9|) (<= 1 |main_#t~mem10|))} is VALID [2022-04-08 03:37:20,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {64305#(and (<= |main_#t~mem11| |main_#t~mem9|) (<= 1 |main_#t~mem10|))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 32: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 36: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 38: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 39: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 40: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 41: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 42: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 43: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 44: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 45: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 46: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 47: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 48: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 49: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,687 INFO L290 TraceCheckUtils]: 50: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 51: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 52: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 53: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 54: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 55: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 56: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 57: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 58: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 59: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 60: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 61: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 62: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 63: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 64: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 65: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 66: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 67: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 68: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 69: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 70: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,688 INFO L290 TraceCheckUtils]: 71: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 72: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 73: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 74: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 75: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 76: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 77: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 78: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 79: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 80: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 81: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 82: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 83: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 84: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 85: Hoare triple {64196#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 86: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 87: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 88: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 89: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 90: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,689 INFO L290 TraceCheckUtils]: 91: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 92: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 93: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 94: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 95: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 96: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 97: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 98: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 99: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 100: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 101: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 102: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 103: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 104: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 105: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 106: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 107: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 108: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 109: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 110: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,690 INFO L290 TraceCheckUtils]: 111: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 112: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 113: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 114: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 115: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 116: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 117: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 118: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 119: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 120: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 121: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 122: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 123: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 124: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 125: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 126: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 127: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 128: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 129: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 130: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,691 INFO L290 TraceCheckUtils]: 131: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 132: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 133: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 134: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 135: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 136: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 137: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 138: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 139: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 140: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 141: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 142: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 143: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 144: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 145: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 146: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 147: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 148: Hoare triple {64196#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 149: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 150: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 151: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,692 INFO L290 TraceCheckUtils]: 152: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 153: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 154: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 155: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 156: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 157: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 158: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 159: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 160: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 161: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 162: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 163: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 164: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 165: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 166: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 167: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 168: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 169: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 170: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 171: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,693 INFO L290 TraceCheckUtils]: 172: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 173: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 174: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 175: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 176: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 177: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 178: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 179: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 180: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 181: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 182: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 183: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 184: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 185: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 186: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 187: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 188: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 189: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 190: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 191: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 192: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,694 INFO L290 TraceCheckUtils]: 193: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 194: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 195: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 196: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 197: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 198: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 199: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 200: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 201: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 202: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 203: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 204: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 205: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 206: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 207: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 208: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 209: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 210: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 211: Hoare triple {64196#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 212: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64196#false} is VALID [2022-04-08 03:37:20,695 INFO L290 TraceCheckUtils]: 213: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 214: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 215: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 216: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 217: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 218: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 219: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 220: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 221: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 222: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 223: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 224: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 225: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 226: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 227: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 228: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 229: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 230: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 231: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 232: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,696 INFO L290 TraceCheckUtils]: 233: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 234: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 235: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 236: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 237: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 238: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 239: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 240: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 241: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 242: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 243: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 244: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 245: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 246: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 247: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 248: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 249: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 250: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 251: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 252: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 253: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,697 INFO L290 TraceCheckUtils]: 254: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 255: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 256: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 257: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 258: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 259: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 260: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 261: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 262: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 263: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 264: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 265: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 266: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 267: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 268: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 269: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 270: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 271: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 272: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 273: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-08 03:37:20,698 INFO L290 TraceCheckUtils]: 274: Hoare triple {64196#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 275: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 276: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 277: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 278: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 279: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 280: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 281: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 282: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 283: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 284: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 285: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 286: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 287: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 288: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 289: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 290: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 291: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 292: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 293: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,699 INFO L290 TraceCheckUtils]: 294: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 295: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 296: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 297: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 298: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 299: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 300: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 301: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 302: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 303: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 304: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 305: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 306: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 307: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 308: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 309: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 310: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 311: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 312: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 313: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 314: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,700 INFO L290 TraceCheckUtils]: 315: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 316: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 317: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 318: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 319: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 320: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 321: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 322: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 323: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 324: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 325: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 326: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 327: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 328: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 329: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 330: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 331: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 332: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 333: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,701 INFO L290 TraceCheckUtils]: 334: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 335: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 336: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 337: Hoare triple {64196#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 338: Hoare triple {64196#false} assume !(~i~0 < ~nodecount~0); {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 339: Hoare triple {64196#false} ~i~0 := 0; {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 340: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 341: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 342: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 343: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 344: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 345: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 346: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 347: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 348: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 349: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 350: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 351: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 352: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 353: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-08 03:37:20,702 INFO L290 TraceCheckUtils]: 354: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-08 03:37:20,703 INFO L290 TraceCheckUtils]: 355: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,703 INFO L290 TraceCheckUtils]: 356: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-08 03:37:20,703 INFO L290 TraceCheckUtils]: 357: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-08 03:37:20,703 INFO L290 TraceCheckUtils]: 358: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,703 INFO L290 TraceCheckUtils]: 359: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-08 03:37:20,703 INFO L290 TraceCheckUtils]: 360: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-08 03:37:20,703 INFO L290 TraceCheckUtils]: 361: Hoare triple {64196#false} assume !(~i~0 < ~edgecount~0); {64196#false} is VALID [2022-04-08 03:37:20,703 INFO L290 TraceCheckUtils]: 362: Hoare triple {64196#false} ~i~0 := 0; {64196#false} is VALID [2022-04-08 03:37:20,703 INFO L290 TraceCheckUtils]: 363: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-08 03:37:20,703 INFO L272 TraceCheckUtils]: 364: Hoare triple {64196#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {64196#false} is VALID [2022-04-08 03:37:20,703 INFO L290 TraceCheckUtils]: 365: Hoare triple {64196#false} ~cond := #in~cond; {64196#false} is VALID [2022-04-08 03:37:20,703 INFO L290 TraceCheckUtils]: 366: Hoare triple {64196#false} assume 0 == ~cond; {64196#false} is VALID [2022-04-08 03:37:20,703 INFO L290 TraceCheckUtils]: 367: Hoare triple {64196#false} assume !false; {64196#false} is VALID [2022-04-08 03:37:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 15490 backedges. 519 proven. 17 refuted. 0 times theorem prover too weak. 14954 trivial. 0 not checked. [2022-04-08 03:37:20,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:37:24,678 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_1176 Int)) (or (not (<= v_main_~x~0_1176 (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)))) (forall ((v_ArrVal_6099 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_1176 4) |c_main_~#distance~0.offset|) v_ArrVal_6099))) (let ((.cse1 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0)) (.cse2 (* c_main_~j~0 4))) (<= (select .cse0 (+ (* 4 (select (select .cse1 |c_main_~#Dest~0.base|) (+ .cse2 4 |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|)) (+ (select .cse0 (+ (* (select (select .cse1 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse2 4)) 4) |c_main_~#distance~0.offset|)) (select (select .cse1 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse2 4))))))))) is different from false [2022-04-08 03:37:25,795 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_1176 Int) (v_ArrVal_6099 Int)) (or (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_1176 4) |c_main_~#distance~0.offset|) v_ArrVal_6099))) (let ((.cse1 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0))) (<= (select .cse0 (+ (* (select (select .cse1 |c_main_~#Dest~0.base|) (+ 4 |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|)) (+ (select (select .cse1 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 4)) (select .cse0 (+ (* (select (select .cse1 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 4)) 4) |c_main_~#distance~0.offset|)))))) (not (<= v_main_~x~0_1176 (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|))))) is different from false [2022-04-08 03:37:44,388 WARN L833 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (not (< (+ main_~i~0 1) c_main_~nodecount~0)) (< (+ main_~i~0 2) c_main_~nodecount~0) (forall ((v_ArrVal_6098 Int) (v_ArrVal_6096 Int) (v_main_~x~0_1176 Int) (v_ArrVal_6099 Int)) (let ((.cse2 (let ((.cse3 (* main_~i~0 4))) (store (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| .cse3) v_ArrVal_6096) (+ 4 |c_main_~#distance~0.offset| .cse3) v_ArrVal_6098)))) (or (let ((.cse0 (store .cse2 (+ (* v_main_~x~0_1176 4) |c_main_~#distance~0.offset|) v_ArrVal_6099))) (let ((.cse1 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0))) (<= (select .cse0 (+ (* (select (select .cse1 |c_main_~#Dest~0.base|) (+ 4 |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|)) (+ (select (select .cse1 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 4)) (select .cse0 (+ (* 4 (select (select .cse1 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 4))) |c_main_~#distance~0.offset|)))))) (not (<= v_main_~x~0_1176 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse2) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|))) (not (<= c_~INFINITY~0 v_ArrVal_6098)) (not (<= v_ArrVal_6096 c_~INFINITY~0))))))) is different from false [2022-04-08 03:37:52,179 INFO L356 Elim1Store]: treesize reduction 414, result has 23.8 percent of original size [2022-04-08 03:37:52,180 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